mirror of
https://github.com/freeCodeCamp/freeCodeCamp.git
synced 2026-03-17 13:01:46 -04:00
chore(i18n,learn): processed translations (#48263)
This commit is contained in:
camperbot
@@ -9,7 +9,7 @@ dashedName: access-multi-dimensional-arrays-with-indexes
|
||||
|
||||
# --description--
|
||||
|
||||
إحدى الطرق للتفكير في قائمة <dfn>عديده الأبعاد(multi-dimensional)</dfn> هي تكون *قائمة من قائمات (array of arrays)*. عندما تستخدم أقواس للوصول إلى القائمة (array)، تشير المجموعة الأولى من الأقواس إلى المواد الموجودة في أعلى فئة (المستوى الأول)، ويشير كل زوج إضافي من الأقواس إلى المستوى التالي من الإدخالات في الداخل.
|
||||
إحدى الطرق للتفكير في قائمة <dfn>عديده الأبعاد(multi-dimensional)</dfn> هي تكون *قائمة من قائمات (array of arrays)*. When you use brackets to access your array, the first set of brackets refers to the entries in the outermost (the first level) array, and each additional pair of brackets refers to the next level of entries inside.
|
||||
|
||||
**مثال**
|
||||
|
||||
|
||||
@@ -24,7 +24,7 @@ dashedName: catch-misspelled-variable-and-function-names
|
||||
assert(netWorkingCapital === 2);
|
||||
```
|
||||
|
||||
لا ينبغي أن تكون هناك استخدامات للمتغيرات تملى بشكل خاطئ في الكود.
|
||||
There should be no instances of misspelled variables in the code.
|
||||
|
||||
```js
|
||||
assert(!code.match(/recievables/g));
|
||||
@@ -36,7 +36,7 @@ assert(!code.match(/recievables/g));
|
||||
assert(code.match(/receivables/g).length == 2);
|
||||
```
|
||||
|
||||
لا ينبغي أن تكون هناك استخدامات للمتغيرات تملى بشكل خاطئ في الكود.
|
||||
There should be no instances of misspelled variables in the code.
|
||||
|
||||
```js
|
||||
assert(!code.match(/payable;/g));
|
||||
|
||||
@@ -14,7 +14,7 @@ dashedName: connect-redux-to-the-messages-app
|
||||
|
||||
# --instructions--
|
||||
|
||||
محرر التعليمات البرمجية لديه كل التعليمات البرمجية التي كتبتها في هذا القسم حتى الآن. التغيير الوحيد هو أن مكون React قد أعيد تسميته إلى `Presentational`. أنشئ مكون جديد محتفظ به في ثابتة تسمى `Container` التي تستخدم `connect` لربط مكون `Presentational` ألى Redux. ثم في `AppWrapper`، انتج مكون React المربوط ألى Redux باسم`Provider`. مرر `Provider` من `store` في Redux كمِيزة (prop) وتنشئ `Container` كفرع. بمجرد إعداد كل شيء، سترى تطبيق الرسائل الذي يتم أنتاجه إلى الصفحة مرة أخرى.
|
||||
محرر التعليمات البرمجية لديه كل التعليمات البرمجية التي كتبتها في هذا القسم حتى الآن. التغيير الوحيد هو أن مكون React قد أعيد تسميته إلى `Presentational`. أنشئ مكون جديد محتفظ به في ثابتة تسمى `Container` التي تستخدم `connect` لربط مكون `Presentational` ألى Redux. ثم في `AppWrapper`، انتج مكون React المربوط ألى Redux باسم`Provider`. مرر `Provider` من `store` في Redux كمِيزة (prop) وتنشئ `Container` كفرع. Once everything is set up, you will see the messages app rendered to the page again.
|
||||
|
||||
# --hints--
|
||||
|
||||
|
||||
@@ -10,7 +10,7 @@ dashedName: add-a-description-to-your-package-json
|
||||
|
||||
The next part of a good package.json file is the `description` field; where a short, but informative description about your project belongs.
|
||||
|
||||
If you some day plan to publish a package to npm, this is the string that should sell your idea to the user when they decide whether to install your package or not. However, that’s not the only use case for the description, it’s a great way to summarize what a project does. It’s just as important in any Node.js project to help other developers, future maintainers or even your future self understand the project quickly.
|
||||
If some day you plan to publish a package to npm, this is the string that should sell your idea to the user when they decide whether to install your package or not. However, that’s not the only use case for the description, it’s a great way to summarize what a project does. It’s just as important in any Node.js project to help other developers, future maintainers or even your future self understand the project quickly.
|
||||
|
||||
Regardless of what you plan for your project, a description is definitely recommended. Here's an example:
|
||||
|
||||
|
||||
@@ -16,7 +16,7 @@ HTTP Strict Transport Security (HSTS) is a web security policy which helps to pr
|
||||
|
||||
Configure `helmet.hsts()` to use HTTPS for the next 90 days. Pass the config object `{maxAge: timeInSeconds, force: true}`. You can create a variable `ninetyDaysInSeconds = 90*24*60*60;` to use for the `timeInSeconds`. Replit already has hsts enabled. To override its settings you need to set the field "force" to true in the config object. We will intercept and restore the Replit header, after inspecting it for testing.
|
||||
|
||||
Note: Configuring HTTPS on a custom website requires the acquisition of a domain, and a SSL/TLS Certificate.
|
||||
Note: Configuring HTTPS on a custom website requires the acquisition of a domain, and an SSL/TLS Certificate.
|
||||
|
||||
# --hints--
|
||||
|
||||
|
||||
@@ -12,7 +12,7 @@ This series of challenges will introduce the tree data structure. Trees are an i
|
||||
|
||||
First, let's describe some common terminology we will encounter with trees. The root node is the top of the tree. Data points in the tree are called nodes. Nodes with branches leading to other nodes are referred to as the parent of the node the branch leads to (the child). Other more complicated familial terms apply as you might expect. A subtree refers to all the descendants of a particular node, branches may be referred to as edges, and leaf nodes are nodes at the end of the tree that have no children. Finally, note that trees are inherently recursive data structures. That is, any children of a node are parents of their own subtree, and so on. The recursive nature of trees is important to understand when designing algorithms for common tree operations.
|
||||
|
||||
To begin, we will discuss a particular type of a tree, the binary tree. In fact, we will actually discuss a particular binary tree, a binary search tree. Let's describe what this means. While the tree data structure can have any number of branches at a single node, a binary tree can only have two branches for every node. Furthermore, a binary search tree is ordered with respect to the child subtrees, such that the value of each node in the left subtree is less than or equal to the value of the parent node, and the value of each node in the right subtree is greater than or equal to the value of the parent node. It's very helpful to visualize this relationship in order to understand it better:
|
||||
To begin, we will discuss a particular type of tree, the binary tree. In fact, we will actually discuss a particular binary tree, a binary search tree. Let's describe what this means. While the tree data structure can have any number of branches at a single node, a binary tree can only have two branches for every node. Furthermore, a binary search tree is ordered with respect to the child subtrees, such that the value of each node in the left subtree is less than or equal to the value of the parent node, and the value of each node in the right subtree is greater than or equal to the value of the parent node. It's very helpful to visualize this relationship in order to understand it better:
|
||||
|
||||
<div style='width: 100%; display: flex; justify-content: center; align-items: center;'><img style='width: 100%; max-width: 350px; background-color: var(--gray-05);' src='https://user-images.githubusercontent.com/18563015/32136009-1e665d98-bbd6-11e7-9133-63184f9f9182.png'></div>
|
||||
|
||||
|
||||
@@ -15,8 +15,8 @@ The specific white cell we will be considering is an ellipse with the equation $
|
||||
The section corresponding to $−0.01 ≤ x ≤ +0.01$ at the top is missing, allowing the light to enter and exit through the hole.
|
||||
|
||||
<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;">
|
||||
<img class="img-responsive center-block" alt="light beam starting at point (0.0, 10.1), and impacting 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 reflections 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).
|
||||
|
||||
@@ -10,7 +10,7 @@ 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 within 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:
|
||||
|
||||
|
||||
@@ -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 arrangements 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.
|
||||
|
||||
|
||||
@@ -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 enclosed-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.
|
||||
|
||||
|
||||
@@ -12,7 +12,7 @@ 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 contain 2 and 3 beans respectively" src="https://cdn.freecodecamp.org/curriculum/project-euler/spilling-the-beans.gif" style="background-color: white; padding: 10px;" />
|
||||
|
||||
You are given the following sequences:
|
||||
|
||||
|
||||
@@ -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 inside a 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:
|
||||
|
||||
|
||||
@@ -38,7 +38,7 @@ const testText = [
|
||||
- The minimum space between columns should be computed from the text and not hard-coded.
|
||||
- It is not a requirement to add separating characters between or around columns.
|
||||
|
||||
For example, one of the lines from the `testText`, after jusitifing to the right, left and center respectivelly:
|
||||
For example, one of the lines from the `testText`, after justifying to the right, left and center respectively:
|
||||
|
||||
```js
|
||||
' column are separated by at least one space.\n'
|
||||
|
||||
@@ -23,7 +23,7 @@ Show that $A(x_1,\\ldots,x_n) \\geq G(x_1,\\ldots,x_n) \\geq H(x_1,\\ldots,x_n)$
|
||||
|
||||
# --instructions--
|
||||
|
||||
When writing your function, assume the input is an ordered array of all inclusive numbers.
|
||||
When writing your function, assume the input is an ordered array of all-inclusive numbers.
|
||||
|
||||
For the answer, please output an object in the following format:
|
||||
|
||||
|
||||
@@ -8,7 +8,7 @@ dashedName: compare-a-list-of-strings
|
||||
|
||||
# --description--
|
||||
|
||||
A list is a ordered set of values that may contain duplicates. Here is an example:
|
||||
A list is an ordered set of values that may contain duplicates. Here is an example:
|
||||
|
||||
```js
|
||||
const list = [['AA', 'BB', 'CC'], ['AA', 'ACB', 'AA'], [], ['AA']];
|
||||
|
||||
@@ -46,7 +46,7 @@ assert(typeof countCoins === 'function');
|
||||
assert.equal(countCoins(15), 6);
|
||||
```
|
||||
|
||||
`countCoins(85)` shouls return `163`.
|
||||
`countCoins(85)` should return `163`.
|
||||
|
||||
```js
|
||||
assert.equal(countCoins(85), 163);
|
||||
|
||||
@@ -12,7 +12,7 @@ The `SHA-2` family is a stronger alternative to `SHA-1`. The main difference bet
|
||||
|
||||
# --instructions--
|
||||
|
||||
Research implemenation details and write a function that takes a string as the parameter and returns a hash using `SHA-256`
|
||||
Research implementation details and write a function that takes a string as the parameter and returns a hash using `SHA-256`
|
||||
|
||||
# --hints--
|
||||
|
||||
|
||||
@@ -12,11 +12,11 @@ Build a full stack JavaScript app that is functionally similar to this: <a href=
|
||||
|
||||
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 unauthenticated user, you can view all bars in your 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 add yourself to a bar to indicate you are 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 authenticated user, you can remove yourself 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.
|
||||
|
||||
|
||||
@@ -119,7 +119,7 @@ const el = document.getElementById('email')
|
||||
assert(!!el && el.required)
|
||||
```
|
||||
|
||||
Your `#email` should be a descendant of `#survey-form`.
|
||||
يجب أن يكون `#email` الخاص بك فرع من `#survey-form`.
|
||||
|
||||
```js
|
||||
const el = document.querySelector('#survey-form #email')
|
||||
|
||||
@@ -421,7 +421,7 @@ assert(cssCheck.length > 0 || htmlSourceAttr.length > 0);
|
||||
equations:<br /><br />
|
||||
<code>y = 3x | y - 6 = x</code>
|
||||
A system of equations IS solvable, but it is a multi-step process. To
|
||||
get started, we need to chose a variable we are solving for. Let's
|
||||
get started, we need to choose a variable we are solving for. Let's
|
||||
solve for "x" first. From the second equation, we know that "x" equals
|
||||
"y - 6", but we cannot simplify that further because we do not have a
|
||||
value for "y". Except, thanks to the system of equations, we DO have a
|
||||
|
||||
@@ -9,7 +9,7 @@ dashedName: step-8
|
||||
|
||||
تعني الخاصية _SVG_ المفيدة (رُسُوم متجهة قابلة للتطوير scalable vector graphics)، هي أنها تحتوي على سمة `path` التي تسمح بتغيير حجم الصورة دون التأثير على دقة الصورة الناتجة من التغيير.
|
||||
|
||||
حاليًا، تأخذ `img` حجمها الافتراضي, وهو كبير جدًا. بشكل صحيح، غيّر حجم الصورة باستخدام `id` كمنتقى، وعيّن `width` ألى `max(100px, 18vw)`.
|
||||
Currently, the `img` is assuming its default size, which is too large. بشكل صحيح، غيّر حجم الصورة باستخدام `id` كمنتقى، وعيّن `width` ألى `max(100px, 18vw)`.
|
||||
|
||||
# --hints--
|
||||
|
||||
|
||||
@@ -7,7 +7,7 @@ dashedName: step-10
|
||||
|
||||
# --description--
|
||||
|
||||
اجعل `header` يأخذ العرض الكامل للحاوية الأصلية (parent container)، وتعيين `height` إلى `50px`، وتعيين `background-color` إلى `#1b1b32`. ثم عيّن `display` لاستخدام _Flexbox_.
|
||||
Make the `header` take up the full width of its parent container, set its `height` to `50px`, and set the `background-color` to `#1b1b32`. ثم عيّن `display` لاستخدام _Flexbox_.
|
||||
|
||||
# --hints--
|
||||
|
||||
|
||||
@@ -7,29 +7,29 @@ dashedName: step-30
|
||||
|
||||
# --description--
|
||||
|
||||
Add an `id` to all of your radio `input`s so you can link your labels to them. Give the first one an `id` of `q1-a1`. Give the rest of them `id`s of `q1-a2`, `q2-a1`, and `q2-a2`, respectively.
|
||||
أضف `id` إلى كل أزرارك `input` بنوع راديو (radio) حتى تتمكن من ربط توصيفاتك (labels) لها. اعطي أول سمة `id` باسم `q1-a1`. امنح الباقي منهم سمات `id` بقيم `q1-a2`, و `q2-a1`, و `q2-a2`على التوالي.
|
||||
|
||||
# --hints--
|
||||
|
||||
You should give the first `input` element an `id` of `q1-a1`.
|
||||
يجب عليك إعطاء أول عنصر `input` سمة `id` بقيمة `q1-a1`.
|
||||
|
||||
```js
|
||||
assert.equal(document.querySelectorAll('ul.answers-list > li > label > input')?.[0]?.id, "q1-a1");
|
||||
```
|
||||
|
||||
You should give the second `input` element an `id` of `q1-a2`.
|
||||
يجب عليك إعطاء ثاني عنصر `input` سمة `id` بقيمة `q1-a2`.
|
||||
|
||||
```js
|
||||
assert.equal(document.querySelectorAll('ul.answers-list > li > label > input')?.[1]?.id, "q1-a2");
|
||||
```
|
||||
|
||||
You should give the third `input` element an `id` of `q2-a1`.
|
||||
يجب عليك إعطاء ثالث عنصر `input` سمة `id` بقيمة `q2-a1`.
|
||||
|
||||
```js
|
||||
assert.equal(document.querySelectorAll('ul.answers-list > li > label > input')?.[2]?.id, "q2-a1");
|
||||
```
|
||||
|
||||
You should give the fourth `input` element an `id` of `q2-a2`.
|
||||
يجب عليك إعطاء رابع عنصر `input` سمة `id` بقيمة `q2-a2`.
|
||||
|
||||
```js
|
||||
assert.equal(document.querySelectorAll('ul.answers-list > li > label > input')?.[3]?.id, "q2-a2");
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 6145e8b5080a5f06bb0223d0
|
||||
title: Step 32
|
||||
title: الخطوة 32
|
||||
challengeType: 0
|
||||
dashedName: step-32
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 6145eb5f08a38a0786c7a80c
|
||||
title: Step 33
|
||||
title: الخطوة 33
|
||||
challengeType: 0
|
||||
dashedName: step-33
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 6145ed1f22caab087630aaad
|
||||
title: Step 34
|
||||
title: الخطوة 34
|
||||
challengeType: 0
|
||||
dashedName: step-34
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 6145ee65e2e1530938cb594d
|
||||
title: Step 35
|
||||
title: الخطوة 35
|
||||
challengeType: 0
|
||||
dashedName: step-35
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 6145f02240ff8f09f7ec913c
|
||||
title: Step 36
|
||||
title: الخطوة 36
|
||||
challengeType: 0
|
||||
dashedName: step-36
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 6145f14f019a4b0adb94b051
|
||||
title: Step 37
|
||||
title: الخطوة 37
|
||||
challengeType: 0
|
||||
dashedName: step-37
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 6145f3a5cd9be60b9459cdd6
|
||||
title: Step 38
|
||||
title: الخطوة 38
|
||||
challengeType: 0
|
||||
dashedName: step-38
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 6145f47393fbe70c4d885f9c
|
||||
title: Step 39
|
||||
title: الخطوة 39
|
||||
challengeType: 0
|
||||
dashedName: step-39
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 6145f59029474c0d3dc1c8b8
|
||||
title: Step 40
|
||||
title: الخطوة 40
|
||||
challengeType: 0
|
||||
dashedName: step-40
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 6145f685797bd30df9784e8c
|
||||
title: Step 41
|
||||
title: الخطوة 41
|
||||
challengeType: 0
|
||||
dashedName: step-41
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 6145f829ac6a920ebf5797d7
|
||||
title: Step 42
|
||||
title: الخطوة 42
|
||||
challengeType: 0
|
||||
dashedName: step-42
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 6145fb5018cb5b100cb2a88c
|
||||
title: Step 44
|
||||
title: الخطوة 44
|
||||
challengeType: 0
|
||||
dashedName: step-44
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 6145fc3707fc3310c277f5c8
|
||||
title: Step 45
|
||||
title: الخطوة 45
|
||||
challengeType: 0
|
||||
dashedName: step-45
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 614796cb8086be482d60e0ac
|
||||
title: Step 46
|
||||
title: الخطوة 46
|
||||
challengeType: 0
|
||||
dashedName: step-46
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 6147a14ef5668b5881ef2297
|
||||
title: Step 47
|
||||
title: الخطوة 47
|
||||
challengeType: 0
|
||||
dashedName: step-47
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 614878f7a412310647873015
|
||||
title: Step 48
|
||||
title: الخطوة 48
|
||||
challengeType: 0
|
||||
dashedName: step-48
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 61487b77d4a37707073a64e5
|
||||
title: Step 49
|
||||
title: الخطوة 49
|
||||
challengeType: 0
|
||||
dashedName: step-49
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 61487da611a65307e78d2c20
|
||||
title: Step 50
|
||||
title: الخطوة 50
|
||||
challengeType: 0
|
||||
dashedName: step-50
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 61487f703571b60899055cf9
|
||||
title: Step 51
|
||||
title: الخطوة 51
|
||||
challengeType: 0
|
||||
dashedName: step-51
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 614880dc16070e093e29bc56
|
||||
title: Step 52
|
||||
title: الخطوة 52
|
||||
challengeType: 0
|
||||
dashedName: step-52
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 614883b6fa720e09fb167de9
|
||||
title: Step 53
|
||||
title: الخطوة 53
|
||||
challengeType: 0
|
||||
dashedName: step-53
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 614884c1f5d6f30ab3d78cde
|
||||
title: Step 54
|
||||
title: الخطوة 54
|
||||
challengeType: 0
|
||||
dashedName: step-54
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 61488ecfd05e290b5712e6da
|
||||
title: Step 55
|
||||
title: الخطوة 55
|
||||
challengeType: 0
|
||||
dashedName: step-55
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 6148d99cdc7acd0c519862cb
|
||||
title: Step 56
|
||||
title: الخطوة 56
|
||||
challengeType: 0
|
||||
dashedName: step-56
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 6148da157cc0bd0d06df5c0a
|
||||
title: Step 57
|
||||
title: الخطوة 57
|
||||
challengeType: 0
|
||||
dashedName: step-57
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 6148dcaaf2e8750e6cb4501a
|
||||
title: Step 59
|
||||
title: الخطوة 59
|
||||
challengeType: 0
|
||||
dashedName: step-59
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 6148dd31d210990f0fb140f8
|
||||
title: Step 60
|
||||
title: الخطوة 60
|
||||
challengeType: 0
|
||||
dashedName: step-60
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 6148dfab9b54c110577de165
|
||||
title: Step 62
|
||||
title: الخطوة 62
|
||||
challengeType: 0
|
||||
dashedName: step-62
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 6148e0bcc13efd10f7d7a6a9
|
||||
title: Step 63
|
||||
title: الخطوة 63
|
||||
challengeType: 0
|
||||
dashedName: step-63
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 6148e161ecec9511941f8833
|
||||
title: Step 64
|
||||
title: الخطوة 64
|
||||
challengeType: 0
|
||||
dashedName: step-64
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 6148e28706b34912340fd042
|
||||
title: Step 65
|
||||
title: الخطوة 65
|
||||
challengeType: 0
|
||||
dashedName: step-65
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 6148e41c728f65138addf9cc
|
||||
title: Step 67
|
||||
title: الخطوة 67
|
||||
challengeType: 0
|
||||
dashedName: step-67
|
||||
---
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
---
|
||||
id: 6148e5aeb102e3142de026a2
|
||||
title: Step 68
|
||||
title: الخطوة 68
|
||||
challengeType: 0
|
||||
dashedName: step-68
|
||||
---
|
||||
|
||||
@@ -51,7 +51,7 @@ assert(
|
||||
assert($('input')[0].hasAttribute('type'));
|
||||
```
|
||||
|
||||
Your new `input` element should have only one `type` attribute. Remove any extras.
|
||||
يجب ألا يحتوي عنصرك `input` على سمة `type`. أزل أي زيادات.
|
||||
|
||||
```js
|
||||
assert($('input')[0]
|
||||
@@ -61,7 +61,7 @@ assert($('input')[0]
|
||||
);
|
||||
```
|
||||
|
||||
Your new `input` element should have a `type` attribute with the value `radio`. You have either omitted the value or have a typo. Remember that attribute values should be surrounded with quotation marks.
|
||||
يجب أن يحتوي عنصرك `input` على سمة `type` بقيمة `radio`. إما أنك حذفت القيمة أو لديك خطأ إملائي. تذكر أن تحيط قيمة السمة بعلامات اقتباس.
|
||||
|
||||
```js
|
||||
assert(
|
||||
@@ -71,20 +71,20 @@ assert(
|
||||
);
|
||||
```
|
||||
|
||||
Although you have set the new `input` element's `type` attribute to `radio`, it is recommended to always surround the value of an attribute with quotation marks.
|
||||
مع أنّك عيّنت عنصر `input` سمة `type` إلى `radio`، يوصى بأن تحيط دائما قيمة السمة بعلامات اقتباس.
|
||||
|
||||
```js
|
||||
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.
|
||||
يجب أن يوجد نص `Indoor` لزر `radio`، بعد الرز وليس قبله.
|
||||
|
||||
```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.
|
||||
يجب أن يكون نص `Indoor` مباشرة على يمين زر `radio`. إما أنك حذفت النص أو لديك خطأ إملائي.
|
||||
|
||||
```js
|
||||
const radioInputElem = $('input')[0];
|
||||
|
||||
@@ -119,7 +119,7 @@ const el = document.getElementById('email')
|
||||
assert(!!el && el.required)
|
||||
```
|
||||
|
||||
Your `#email` should be a descendant of `#survey-form`.
|
||||
你的 `#email` 元素應該是 `#survey-form` 元素的子元素。
|
||||
|
||||
```js
|
||||
const el = document.querySelector('#survey-form #email')
|
||||
|
||||
@@ -9,7 +9,7 @@ dashedName: access-multi-dimensional-arrays-with-indexes
|
||||
|
||||
# --description--
|
||||
|
||||
我們可以把<dfn>多維</dfn>數組看作成是*數組中的數組*。 使用方括號表示法訪問數組時，第一個方括號訪問的是數組的最外層（第一層），第二個方括號訪問的是數組的第二層，以此類推。
|
||||
我們可以把<dfn>多維</dfn>數組看作成是*數組中的數組*。 When you use brackets to access your array, the first set of brackets refers to the entries in the outermost (the first level) array, and each additional pair of brackets refers to the next level of entries inside.
|
||||
|
||||
**例如：**
|
||||
|
||||
|
||||
@@ -24,7 +24,7 @@ dashedName: catch-misspelled-variable-and-function-names
|
||||
assert(netWorkingCapital === 2);
|
||||
```
|
||||
|
||||
代碼中不應存在拼寫錯誤的變量。
|
||||
There should be no instances of misspelled variables in the code.
|
||||
|
||||
```js
|
||||
assert(!code.match(/recievables/g));
|
||||
@@ -36,7 +36,7 @@ assert(!code.match(/recievables/g));
|
||||
assert(code.match(/receivables/g).length == 2);
|
||||
```
|
||||
|
||||
代碼中不應存在拼寫錯誤的變量。
|
||||
There should be no instances of misspelled variables in the code.
|
||||
|
||||
```js
|
||||
assert(!code.match(/payable;/g));
|
||||
|
||||
@@ -14,7 +14,7 @@ dashedName: connect-redux-to-the-messages-app
|
||||
|
||||
# --instructions--
|
||||
|
||||
到目前爲止，我們的編輯器上已包含了整個章節的代碼， 唯一不同的是，React 組件被重新命名爲 `Presentational`，即展示層組件。 創建一個新組件，保存在名爲 `Container` 的常量中。 這個常量用 `connect` 把 `Presentational` 組件和 Redux 連接起來。 然後，在`AppWrapper` 中渲染 React Redux 的 `Provider`組件， 給 `Provider` 傳入 Redux `store` 屬性並渲染 `Container` 爲子組件。 設置完所有內容後，將再次看到消息應用程序渲染到頁面上。
|
||||
到目前爲止，我們的編輯器上已包含了整個章節的代碼， 唯一不同的是，React 組件被重新命名爲 `Presentational`，即展示層組件。 創建一個新組件，保存在名爲 `Container` 的常量中。 這個常量用 `connect` 把 `Presentational` 組件和 Redux 連接起來。 然後，在`AppWrapper` 中渲染 React Redux 的 `Provider`組件， 給 `Provider` 傳入 Redux `store` 屬性並渲染 `Container` 爲子組件。 Once everything is set up, you will see the messages app rendered to the page again.
|
||||
|
||||
# --hints--
|
||||
|
||||
|
||||
@@ -10,7 +10,7 @@ dashedName: add-a-description-to-your-package-json
|
||||
|
||||
一個好的 package.json 文件的下一部分就是 `description` 字段——簡短精悍的的項目描述。
|
||||
|
||||
如果你計劃將來把這個包發佈到 npm，請注意 description 字段的作用是告知用戶這個包的用途，這樣用戶就可以決定是否要安裝你發佈的包。 然而，這並不是使用描述的唯一場景：它也是一種很好的總結項目的方式， 可以幫助其它開發者、維護者甚至自己在未來快速地瞭解項目，對於任何一個 Node.js 項目來說都非常重要。
|
||||
If some day you plan to publish a package to npm, this is the string that should sell your idea to the user when they decide whether to install your package or not. 然而，這並不是使用描述的唯一場景：它也是一種很好的總結項目的方式， 可以幫助其它開發者、維護者甚至自己在未來快速地瞭解項目，對於任何一個 Node.js 項目來說都非常重要。
|
||||
|
||||
無論項目計劃是什麼，都建議使用描述。 類似這樣：
|
||||
|
||||
|
||||
@@ -16,7 +16,7 @@ HTTP 嚴格傳輸安全（HSTS）是一種網絡安全策略，有助於保護
|
||||
|
||||
配置 `helmet.hsts()` 以在未來 90 天內使用 HTTPS。 傳遞配置對象 `{maxAge: timeInSeconds, force: true}`。 你可以創建一個變量 `ninetyDaysInSeconds = 90*24*60*60;` 來用於 `timeInSeconds`。 Replit 已經啓用了 hsts。 要覆蓋它的設置，你需要在配置對象中把 “force” 字段設置爲 true。 我們將攔截並在對其進行檢查測試後恢復 Replit 請求頭。
|
||||
|
||||
注意：在自定義網站上配置 HTTPS 需要獲得一個域名，以及一個 SSL/TLS 證書。
|
||||
Note: Configuring HTTPS on a custom website requires the acquisition of a domain, and an SSL/TLS Certificate.
|
||||
|
||||
# --hints--
|
||||
|
||||
|
||||
@@ -12,7 +12,7 @@ dashedName: add-a-new-element-to-a-binary-search-tree
|
||||
|
||||
首先，讓我們描述一下我們將遇到的關於樹的一些常見術語。 根節點（root）是樹的頂部。 樹中的數據點稱爲節點（node）。 分支通向其他節點的節點稱爲分支通向的節點（即子節點）的父節點。 如你所料，其他更復雜的家庭術語也適用。 子樹指的是某一特定節點的所有後代，分支可稱爲邊，而葉子節點是位於樹的末端的且沒有子節點的節點。 最後，請注意，樹本質上是遞歸的數據結構。 也就是說，一個節點的任何子節點都是其自己的子樹的父節點，依此類推。 在爲常見的樹操作設計算法時，樹的遞歸性質很重要。
|
||||
|
||||
首先，我們將討論樹的一個特殊類型，即二叉樹。 實際上，我們將討論特定的二叉樹，即二叉搜索樹。 讓我們來看看這意味着什麼。 雖然樹形數據結構在一個節點上可以有任意數量的分支，但二叉樹每個節點只能有兩個分支。 此外，一個二叉搜索樹相對於其子子樹是有序的，即對於一個節點而言，其左子樹中每個節點的值都小於或等於該節點的值，而其右子樹中每個節點的值都大於或等於該節點的值。 爲了更好地理解這種關係，將這種關係形象化是非常有幫助的：
|
||||
To begin, we will discuss a particular type of tree, the binary tree. 實際上，我們將討論特定的二叉樹，即二叉搜索樹。 讓我們來看看這意味着什麼。 雖然樹形數據結構在一個節點上可以有任意數量的分支，但二叉樹每個節點只能有兩個分支。 此外，一個二叉搜索樹相對於其子子樹是有序的，即對於一個節點而言，其左子樹中每個節點的值都小於或等於該節點的值，而其右子樹中每個節點的值都大於或等於該節點的值。 爲了更好地理解這種關係，將這種關係形象化是非常有幫助的：
|
||||
|
||||
<div style='width: 100%; display: flex; justify-content: center; align-items: center;'><img style='width: 100%; max-width: 350px; background-color: var(--gray-05);' src='https://user-images.githubusercontent.com/18563015/32136009-1e665d98-bbd6-11e7-9133-63184f9f9182.png'></div>
|
||||
|
||||
|
||||
@@ -15,8 +15,8 @@ dashedName: problem-144-investigating-multiple-reflections-of-a-laser-beam
|
||||
橢圓頂部削去了 $−0.01 ≤ x ≤ +0.01$ 的部分，使得激光束可以通過該部分進入和離開白腔。
|
||||
|
||||
<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;">
|
||||
<img class="img-responsive center-block" alt="light beam starting at point (0.0, 10.1), and impacting 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 reflections 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>
|
||||
|
||||
本題中，激光束從白腔外一點 (0.0, 10.1) 發出，首次接觸鏡面的點爲 (1.4, -9.6)。
|
||||
|
||||
@@ -10,7 +10,7 @@ dashedName: problem-147-rectangles-in-cross-hatched-grids
|
||||
|
||||
如圖所示，在 3 x 2 的交叉對角線網格中，共有 37 個不同的矩形可以放置於該網格內。
|
||||
|
||||
<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;" />
|
||||
<img class="img-responsive center-block" alt="ways of situating different rectangles within cross-hatched 3x2 grid" src="https://cdn.freecodecamp.org/curriculum/project-euler/rectangles-in-cross-hatched-grids.png" style="background-color: white; padding: 10px;" />
|
||||
|
||||
從長和寬的角度考慮，有 5 種小於 3 x 2 網格的矩形，即 1 x 1、2 x 1、3 x 1、1 x 2 和 2 x 2。 若畫出上述矩形的交叉對角線，則有不同的矩形可以位於這些更小的網格中，對應數量如下：
|
||||
|
||||
|
||||
@@ -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 arrangements 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.
|
||||
|
||||
|
||||
@@ -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 enclosed-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.
|
||||
|
||||
|
||||
@@ -12,7 +12,7 @@ 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 contain 2 and 3 beans respectively" src="https://cdn.freecodecamp.org/curriculum/project-euler/spilling-the-beans.gif" style="background-color: white; padding: 10px;" />
|
||||
|
||||
You are given the following sequences:
|
||||
|
||||
|
||||
@@ -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 inside a 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:
|
||||
|
||||
|
||||
@@ -38,7 +38,7 @@ const testText = [
|
||||
- 列之間的最小間距應根據文本計算，而不是硬編碼。
|
||||
- 不需要在列之間或列周圍添加分隔字符。
|
||||
|
||||
For example, one of the lines from the `testText`, after jusitifing to the right, left and center respectivelly:
|
||||
For example, one of the lines from the `testText`, after justifying to the right, left and center respectively:
|
||||
|
||||
```js
|
||||
' column are separated by at least one space.\n'
|
||||
|
||||
@@ -23,7 +23,7 @@ Show that $A(x_1,\\ldots,x_n) \\geq G(x_1,\\ldots,x_n) \\geq H(x_1,\\ldots,x_n)$
|
||||
|
||||
# --instructions--
|
||||
|
||||
When writing your function, assume the input is an ordered array of all inclusive numbers.
|
||||
When writing your function, assume the input is an ordered array of all-inclusive numbers.
|
||||
|
||||
For the answer, please output an object in the following format:
|
||||
|
||||
|
||||
@@ -8,7 +8,7 @@ dashedName: compare-a-list-of-strings
|
||||
|
||||
# --description--
|
||||
|
||||
A list is a ordered set of values that may contain duplicates. Here is an example:
|
||||
A list is an ordered set of values that may contain duplicates. Here is an example:
|
||||
|
||||
```js
|
||||
const list = [['AA', 'BB', 'CC'], ['AA', 'ACB', 'AA'], [], ['AA']];
|
||||
|
||||
@@ -46,7 +46,7 @@ assert(typeof countCoins === 'function');
|
||||
assert.equal(countCoins(15), 6);
|
||||
```
|
||||
|
||||
`countCoins(85)` 應該返回 `163`。
|
||||
`countCoins(85)` should return `163`.
|
||||
|
||||
```js
|
||||
assert.equal(countCoins(85), 163);
|
||||
|
||||
@@ -12,7 +12,7 @@ dashedName: sha-256
|
||||
|
||||
# --instructions--
|
||||
|
||||
研究實現細節並編寫一個函數，該函數以字符串爲參數並使用 `SHA-256` 返回哈希值
|
||||
Research implementation details and write a function that takes a string as the parameter and returns a hash using `SHA-256`
|
||||
|
||||
# --hints--
|
||||
|
||||
|
||||
@@ -12,11 +12,11 @@ Build a full stack JavaScript app that is functionally similar to this: <a href=
|
||||
|
||||
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 unauthenticated user, you can view all bars in your area.
|
||||
|
||||
**用戶故事：** 作爲一名經過身份驗證的用戶，我可以將自己添加到一個欄中，以表明我今晚要去那裏。
|
||||
**User Story:** As an authenticated user, you can add yourself to a bar to indicate you are going there tonight.
|
||||
|
||||
**用戶故事：** 作爲一名經過身份驗證的用戶，如果我不想再去那裏，我可以將自己從酒吧中刪除。
|
||||
**User Story:** As an authenticated user, you can remove yourself from a bar if you no longer want to go there.
|
||||
|
||||
**用戶故事：** 作爲未經身份驗證的用戶，當我登錄時，我不需要再次搜索。
|
||||
|
||||
|
||||
@@ -421,7 +421,7 @@ assert(cssCheck.length > 0 || htmlSourceAttr.length > 0);
|
||||
equations:<br /><br />
|
||||
<code>y = 3x | y - 6 = x</code>
|
||||
A system of equations IS solvable, but it is a multi-step process. To
|
||||
get started, we need to chose a variable we are solving for. Let's
|
||||
get started, we need to choose a variable we are solving for. Let's
|
||||
solve for "x" first. From the second equation, we know that "x" equals
|
||||
"y - 6", but we cannot simplify that further because we do not have a
|
||||
value for "y". Except, thanks to the system of equations, we DO have a
|
||||
|
||||
@@ -9,7 +9,7 @@ dashedName: step-8
|
||||
|
||||
_SVG_（可縮放矢量圖形）的一個有用之處是它包含一個 `path` 屬性，該屬性允許在不影響圖像分辨率的情況下縮放圖像。
|
||||
|
||||
`img` 當前是默認尺寸，這個尺寸太大。 可以使用它的 `id` 作爲選擇器來縮放圖像，並將 `width` 設置爲 `max(100px, 18vw)`。
|
||||
Currently, the `img` is assuming its default size, which is too large. 可以使用它的 `id` 作爲選擇器來縮放圖像，並將 `width` 設置爲 `max(100px, 18vw)`。
|
||||
|
||||
# --hints--
|
||||
|
||||
|
||||
@@ -7,7 +7,7 @@ dashedName: step-10
|
||||
|
||||
# --description--
|
||||
|
||||
使 `header` 佔用其父容器的全寬， 設置它的 `height` 爲 `50px`，並將 屬性`background-color` 設置爲 `#1b1b32`。 然後設置 `display` 屬性時使用 _Flexbox_。
|
||||
Make the `header` take up the full width of its parent container, set its `height` to `50px`, and set the `background-color` to `#1b1b32`. 然後設置 `display` 屬性時使用 _Flexbox_。
|
||||
|
||||
# --hints--
|
||||
|
||||
|
||||
@@ -119,7 +119,7 @@ const el = document.getElementById('email')
|
||||
assert(!!el && el.required)
|
||||
```
|
||||
|
||||
Your `#email` should be a descendant of `#survey-form`.
|
||||
你的 `#email` 元素应该是 `#survey-form` 元素的子元素。
|
||||
|
||||
```js
|
||||
const el = document.querySelector('#survey-form #email')
|
||||
|
||||
@@ -9,7 +9,7 @@ dashedName: access-multi-dimensional-arrays-with-indexes
|
||||
|
||||
# --description--
|
||||
|
||||
我们可以把<dfn>多维</dfn>数组看作成是*数组中的数组*。 使用方括号表示法访问数组时，第一个方括号访问的是数组的最外层（第一层），第二个方括号访问的是数组的第二层，以此类推。
|
||||
我们可以把<dfn>多维</dfn>数组看作成是*数组中的数组*。 When you use brackets to access your array, the first set of brackets refers to the entries in the outermost (the first level) array, and each additional pair of brackets refers to the next level of entries inside.
|
||||
|
||||
**例如：**
|
||||
|
||||
|
||||
@@ -24,7 +24,7 @@ dashedName: catch-misspelled-variable-and-function-names
|
||||
assert(netWorkingCapital === 2);
|
||||
```
|
||||
|
||||
代码中不应存在拼写错误的变量。
|
||||
There should be no instances of misspelled variables in the code.
|
||||
|
||||
```js
|
||||
assert(!code.match(/recievables/g));
|
||||
@@ -36,7 +36,7 @@ assert(!code.match(/recievables/g));
|
||||
assert(code.match(/receivables/g).length == 2);
|
||||
```
|
||||
|
||||
代码中不应存在拼写错误的变量。
|
||||
There should be no instances of misspelled variables in the code.
|
||||
|
||||
```js
|
||||
assert(!code.match(/payable;/g));
|
||||
|
||||
@@ -14,7 +14,7 @@ dashedName: connect-redux-to-the-messages-app
|
||||
|
||||
# --instructions--
|
||||
|
||||
到目前为止，我们的编辑器上已包含了整个章节的代码， 唯一不同的是，React 组件被重新命名为 `Presentational`，即展示层组件。 创建一个新组件，保存在名为 `Container` 的常量中。 这个常量用 `connect` 把 `Presentational` 组件和 Redux 连接起来。 然后，在`AppWrapper` 中渲染 React Redux 的 `Provider`组件， 给 `Provider` 传入 Redux `store` 属性并渲染 `Container` 为子组件。 设置完所有内容后，将再次看到消息应用程序渲染到页面上。
|
||||
到目前为止，我们的编辑器上已包含了整个章节的代码， 唯一不同的是，React 组件被重新命名为 `Presentational`，即展示层组件。 创建一个新组件，保存在名为 `Container` 的常量中。 这个常量用 `connect` 把 `Presentational` 组件和 Redux 连接起来。 然后，在`AppWrapper` 中渲染 React Redux 的 `Provider`组件， 给 `Provider` 传入 Redux `store` 属性并渲染 `Container` 为子组件。 Once everything is set up, you will see the messages app rendered to the page again.
|
||||
|
||||
# --hints--
|
||||
|
||||
|
||||
@@ -10,7 +10,7 @@ dashedName: add-a-description-to-your-package-json
|
||||
|
||||
一个好的 package.json 文件的下一部分就是 `description` 字段——简短精悍的的项目描述。
|
||||
|
||||
如果你计划将来把这个包发布到 npm，请注意 description 字段的作用是告知用户这个包的用途，这样用户就可以决定是否要安装你发布的包。 然而，这并不是使用描述的唯一场景：它也是一种很好的总结项目的方式， 可以帮助其它开发者、维护者甚至自己在未来快速地了解项目，对于任何一个 Node.js 项目来说都非常重要。
|
||||
If some day you plan to publish a package to npm, this is the string that should sell your idea to the user when they decide whether to install your package or not. 然而，这并不是使用描述的唯一场景：它也是一种很好的总结项目的方式， 可以帮助其它开发者、维护者甚至自己在未来快速地了解项目，对于任何一个 Node.js 项目来说都非常重要。
|
||||
|
||||
无论项目计划是什么，都建议使用描述。 类似这样：
|
||||
|
||||
|
||||
@@ -16,7 +16,7 @@ HTTP 严格传输安全（HSTS）是一种网络安全策略，有助于保护
|
||||
|
||||
配置 `helmet.hsts()` 以在未来 90 天内使用 HTTPS。 传递配置对象 `{maxAge: timeInSeconds, force: true}`。 你可以创建一个变量 `ninetyDaysInSeconds = 90*24*60*60;` 来用于 `timeInSeconds`。 Replit 已经启用了 hsts。 要覆盖它的设置，你需要在配置对象中把 “force” 字段设置为 true。 我们将拦截并在对其进行检查测试后恢复 Replit 请求头。
|
||||
|
||||
注意：在自定义网站上配置 HTTPS 需要获得一个域名，以及一个 SSL/TLS 证书。
|
||||
Note: Configuring HTTPS on a custom website requires the acquisition of a domain, and an SSL/TLS Certificate.
|
||||
|
||||
# --hints--
|
||||
|
||||
|
||||
@@ -12,7 +12,7 @@ dashedName: add-a-new-element-to-a-binary-search-tree
|
||||
|
||||
首先，让我们描述一下我们将遇到的关于树的一些常见术语。 根节点（root）是树的顶部。 树中的数据点称为节点（node）。 分支通向其他节点的节点称为分支通向的节点（即子节点）的父节点。 如你所料，其他更复杂的家庭术语也适用。 子树指的是某一特定节点的所有后代，分支可称为边，而叶子节点是位于树的末端的且没有子节点的节点。 最后，请注意，树本质上是递归的数据结构。 也就是说，一个节点的任何子节点都是其自己的子树的父节点，依此类推。 在为常见的树操作设计算法时，树的递归性质很重要。
|
||||
|
||||
首先，我们将讨论树的一个特殊类型，即二叉树。 实际上，我们将讨论特定的二叉树，即二叉搜索树。 让我们来看看这意味着什么。 虽然树形数据结构在一个节点上可以有任意数量的分支，但二叉树每个节点只能有两个分支。 此外，一个二叉搜索树相对于其子子树是有序的，即对于一个节点而言，其左子树中每个节点的值都小于或等于该节点的值，而其右子树中每个节点的值都大于或等于该节点的值。 为了更好地理解这种关系，将这种关系形象化是非常有帮助的：
|
||||
To begin, we will discuss a particular type of tree, the binary tree. 实际上，我们将讨论特定的二叉树，即二叉搜索树。 让我们来看看这意味着什么。 虽然树形数据结构在一个节点上可以有任意数量的分支，但二叉树每个节点只能有两个分支。 此外，一个二叉搜索树相对于其子子树是有序的，即对于一个节点而言，其左子树中每个节点的值都小于或等于该节点的值，而其右子树中每个节点的值都大于或等于该节点的值。 为了更好地理解这种关系，将这种关系形象化是非常有帮助的：
|
||||
|
||||
<div style='width: 100%; display: flex; justify-content: center; align-items: center;'><img style='width: 100%; max-width: 350px; background-color: var(--gray-05);' src='https://user-images.githubusercontent.com/18563015/32136009-1e665d98-bbd6-11e7-9133-63184f9f9182.png'></div>
|
||||
|
||||
|
||||
@@ -15,8 +15,8 @@ dashedName: problem-144-investigating-multiple-reflections-of-a-laser-beam
|
||||
椭圆顶部削去了 $−0.01 ≤ x ≤ +0.01$ 的部分，使得激光束可以通过该部分进入和离开白腔。
|
||||
|
||||
<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;">
|
||||
<img class="img-responsive center-block" alt="light beam starting at point (0.0, 10.1), and impacting 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 reflections 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>
|
||||
|
||||
本题中，激光束从白腔外一点 (0.0, 10.1) 发出，首次接触镜面的点为 (1.4, -9.6)。
|
||||
|
||||
@@ -10,7 +10,7 @@ dashedName: problem-147-rectangles-in-cross-hatched-grids
|
||||
|
||||
如图所示，在 3 x 2 的交叉对角线网格中，共有 37 个不同的矩形可以放置于该网格内。
|
||||
|
||||
<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;" />
|
||||
<img class="img-responsive center-block" alt="ways of situating different rectangles within cross-hatched 3x2 grid" src="https://cdn.freecodecamp.org/curriculum/project-euler/rectangles-in-cross-hatched-grids.png" style="background-color: white; padding: 10px;" />
|
||||
|
||||
从长和宽的角度考虑，有 5 种小于 3 x 2 网格的矩形，即 1 x 1、2 x 1、3 x 1、1 x 2 和 2 x 2。 若画出上述矩形的交叉对角线，则有不同的矩形可以位于这些更小的网格中，对应数量如下：
|
||||
|
||||
|
||||
@@ -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 arrangements 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.
|
||||
|
||||
|
||||
@@ -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 enclosed-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.
|
||||
|
||||
|
||||
@@ -12,7 +12,7 @@ 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 contain 2 and 3 beans respectively" src="https://cdn.freecodecamp.org/curriculum/project-euler/spilling-the-beans.gif" style="background-color: white; padding: 10px;" />
|
||||
|
||||
You are given the following sequences:
|
||||
|
||||
|
||||
@@ -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 inside a 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:
|
||||
|
||||
|
||||
@@ -38,7 +38,7 @@ const testText = [
|
||||
- 列之间的最小间距应根据文本计算，而不是硬编码。
|
||||
- 不需要在列之间或列周围添加分隔字符。
|
||||
|
||||
For example, one of the lines from the `testText`, after jusitifing to the right, left and center respectivelly:
|
||||
For example, one of the lines from the `testText`, after justifying to the right, left and center respectively:
|
||||
|
||||
```js
|
||||
' column are separated by at least one space.\n'
|
||||
|
||||
@@ -23,7 +23,7 @@ Show that $A(x_1,\\ldots,x_n) \\geq G(x_1,\\ldots,x_n) \\geq H(x_1,\\ldots,x_n)$
|
||||
|
||||
# --instructions--
|
||||
|
||||
When writing your function, assume the input is an ordered array of all inclusive numbers.
|
||||
When writing your function, assume the input is an ordered array of all-inclusive numbers.
|
||||
|
||||
For the answer, please output an object in the following format:
|
||||
|
||||
|
||||
@@ -8,7 +8,7 @@ dashedName: compare-a-list-of-strings
|
||||
|
||||
# --description--
|
||||
|
||||
A list is a ordered set of values that may contain duplicates. Here is an example:
|
||||
A list is an ordered set of values that may contain duplicates. Here is an example:
|
||||
|
||||
```js
|
||||
const list = [['AA', 'BB', 'CC'], ['AA', 'ACB', 'AA'], [], ['AA']];
|
||||
|
||||
@@ -46,7 +46,7 @@ assert(typeof countCoins === 'function');
|
||||
assert.equal(countCoins(15), 6);
|
||||
```
|
||||
|
||||
`countCoins(85)` 应该返回 `163`。
|
||||
`countCoins(85)` should return `163`.
|
||||
|
||||
```js
|
||||
assert.equal(countCoins(85), 163);
|
||||
|
||||
@@ -12,7 +12,7 @@ dashedName: sha-256
|
||||
|
||||
# --instructions--
|
||||
|
||||
研究实现细节并编写一个函数，该函数以字符串为参数并使用 `SHA-256` 返回哈希值
|
||||
Research implementation details and write a function that takes a string as the parameter and returns a hash using `SHA-256`
|
||||
|
||||
# --hints--
|
||||
|
||||
|
||||
@@ -12,11 +12,11 @@ Build a full stack JavaScript app that is functionally similar to this: <a href=
|
||||
|
||||
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 unauthenticated user, you can view all bars in your area.
|
||||
|
||||
**用户故事：** 作为一名经过身份验证的用户，我可以将自己添加到一个栏中，以表明我今晚要去那里。
|
||||
**User Story:** As an authenticated user, you can add yourself to a bar to indicate you are going there tonight.
|
||||
|
||||
**用户故事：** 作为一名经过身份验证的用户，如果我不想再去那里，我可以将自己从酒吧中删除。
|
||||
**User Story:** As an authenticated user, you can remove yourself from a bar if you no longer want to go there.
|
||||
|
||||
**用户故事：** 作为未经身份验证的用户，当我登录时，我不需要再次搜索。
|
||||
|
||||
|
||||
@@ -421,7 +421,7 @@ assert(cssCheck.length > 0 || htmlSourceAttr.length > 0);
|
||||
equations:<br /><br />
|
||||
<code>y = 3x | y - 6 = x</code>
|
||||
A system of equations IS solvable, but it is a multi-step process. To
|
||||
get started, we need to chose a variable we are solving for. Let's
|
||||
get started, we need to choose a variable we are solving for. Let's
|
||||
solve for "x" first. From the second equation, we know that "x" equals
|
||||
"y - 6", but we cannot simplify that further because we do not have a
|
||||
value for "y". Except, thanks to the system of equations, we DO have a
|
||||
|
||||
@@ -9,7 +9,7 @@ dashedName: step-8
|
||||
|
||||
_SVG_（可缩放矢量图形）的一个有用之处是它包含一个 `path` 属性，该属性允许在不影响图像分辨率的情况下缩放图像。
|
||||
|
||||
`img` 当前是默认尺寸，这个尺寸太大。 可以使用它的 `id` 作为选择器来缩放图像，并将 `width` 设置为 `max(100px, 18vw)`。
|
||||
Currently, the `img` is assuming its default size, which is too large. 可以使用它的 `id` 作为选择器来缩放图像，并将 `width` 设置为 `max(100px, 18vw)`。
|
||||
|
||||
# --hints--
|
||||
|
||||
|
||||
Some files were not shown because too many files have changed in this diff Show More
Reference in New Issue
Block a user