Removes RSA links from English challenges (#37869)
* RSA links deleted from challenges * fix: remove remaining RSA links in challenges
This commit is contained in:
Kiara Barias
GitHub
@ -10,7 +10,6 @@ forumTopicId: 16000
|
||||
<section id='description'>
|
||||
Check if a value is classified as a boolean primitive. Return true or false.
|
||||
Boolean primitives are true and false.
|
||||
Remember to use <a href='https://www.freecodecamp.org/forum/t/how-to-get-help-when-you-are-stuck-coding/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Try to pair program. Write your own code.
|
||||
</section>
|
||||
|
||||
## Instructions
|
||||
|
||||
@ -9,7 +9,6 @@ forumTopicId: 16005
|
||||
## Description
|
||||
<section id='description'>
|
||||
Write a function that splits an array (first argument) into groups the length of <code>size</code> (second argument) and returns them as a two-dimensional array.
|
||||
Remember to use <a href="https://www.freecodecamp.org/forum/t/how-to-get-help-when-you-are-stuck-coding/19514" target="_blank">Read-Search-Ask</a> if you get stuck. Write your own code.
|
||||
</section>
|
||||
|
||||
## Instructions
|
||||
|
||||
@ -10,7 +10,6 @@ forumTopicId: 16006
|
||||
<section id='description'>
|
||||
Check if a string (first argument, <code>str</code>) ends with the given target string (second argument, <code>target</code>).
|
||||
This challenge <em>can</em> be solved with the <code>.endsWith()</code> method, which was introduced in ES2015. But for the purpose of this challenge, we would like you to use one of the JavaScript substring methods instead.
|
||||
Remember to use <a href="https://www.freecodecamp.org/forum/t/how-to-get-help-when-you-are-stuck-coding/19514" target="_blank">Read-Search-Ask</a> if you get stuck. Write your own code.
|
||||
</section>
|
||||
|
||||
## Instructions
|
||||
|
||||
@ -13,7 +13,6 @@ If the integer is represented with the letter n, a factorial is the product of a
|
||||
Factorials are often represented with the shorthand notation <code>n!</code>
|
||||
For example: <code>5! = 1 * 2 * 3 * 4 * 5 = 120</code>
|
||||
Only integers greater than or equal to zero will be supplied to the function.
|
||||
Remember to use <a href="https://www.freecodecamp.org/forum/t/how-to-get-help-when-you-are-stuck-coding/19514" target="_blank">Read-Search-Ask</a> if you get stuck. Write your own code.
|
||||
</section>
|
||||
|
||||
## Instructions
|
||||
|
||||
@ -11,7 +11,6 @@ forumTopicId: 16014
|
||||
Remove all falsy values from an array.
|
||||
Falsy values in JavaScript are <code>false</code>, <code>null</code>, <code>0</code>, <code>""</code>, <code>undefined</code>, and <code>NaN</code>.
|
||||
Hint: Try converting each value to a Boolean.
|
||||
Remember to use <a href="https://www.freecodecamp.org/forum/t/how-to-get-help-when-you-are-stuck-coding/19514" target="_blank">Read-Search-Ask</a> if you get stuck. Write your own code.
|
||||
</section>
|
||||
|
||||
## Instructions
|
||||
|
||||
@ -10,7 +10,6 @@ forumTopicId: 16015
|
||||
<section id='description'>
|
||||
Return the length of the longest word in the provided sentence.
|
||||
Your response should be a number.
|
||||
Remember to use <a href="https://www.freecodecamp.org/forum/t/how-to-get-help-when-you-are-stuck-coding/19514" target="_blank">Read-Search-Ask</a> if you get stuck. Write your own code.
|
||||
</section>
|
||||
|
||||
## Instructions
|
||||
|
||||
@ -9,7 +9,6 @@ forumTopicId: 16016
|
||||
## Description
|
||||
<section id='description'>
|
||||
Create a function that looks through an array (first argument) and returns the first element in the array that passes a truth test (second argument). If no element passes the test, return undefined.
|
||||
Remember to use <a href='https://www.freecodecamp.org/forum/t/how-to-get-help-when-you-are-stuck-coding/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Try to pair program. Write your own code.
|
||||
</section>
|
||||
|
||||
## Instructions
|
||||
|
||||
@ -12,7 +12,6 @@ Return true if the string in the first element of the array contains all of the
|
||||
For example, <code>["hello", "Hello"]</code>, should return true because all of the letters in the second string are present in the first, ignoring case.
|
||||
The arguments <code>["hello", "hey"]</code> should return false because the string "hello" does not contain a "y".
|
||||
Lastly, <code>["Alien", "line"]</code>, should return true because all of the letters in "line" are present in "Alien".
|
||||
Remember to use <a href="https://www.freecodecamp.org/forum/t/how-to-get-help-when-you-are-stuck-coding/19514" target="_blank">Read-Search-Ask</a> if you get stuck. Write your own code.
|
||||
</section>
|
||||
|
||||
## Instructions
|
||||
|
||||
@ -9,7 +9,6 @@ forumTopicId: 16041
|
||||
## Description
|
||||
<section id='description'>
|
||||
Repeat a given string <code>str</code> (first argument) for <code>num</code> times (second argument). Return an empty string if <code>num</code> is not a positive number.
|
||||
Remember to use <a href="https://www.freecodecamp.org/forum/t/how-to-get-help-when-you-are-stuck-coding/19514" target="_blank">Read-Search-Ask</a> if you get stuck. Write your own code.
|
||||
</section>
|
||||
|
||||
## Instructions
|
||||
|
||||
@ -10,7 +10,6 @@ forumTopicId: 16042
|
||||
<section id='description'>
|
||||
Return an array consisting of the largest number from each provided sub-array. For simplicity, the provided array will contain exactly 4 sub-arrays.
|
||||
Remember, you can iterate through an array with a simple for loop, and access each member with array syntax <code>arr[i]</code>.
|
||||
Remember to use <a href="https://www.freecodecamp.org/forum/t/how-to-get-help-when-you-are-stuck-coding/19514" target="_blank">Read-Search-Ask</a> if you get stuck. Write your own code.
|
||||
</section>
|
||||
|
||||
## Instructions
|
||||
|
||||
@ -11,7 +11,6 @@ forumTopicId: 16043
|
||||
Reverse the provided string.
|
||||
You may need to turn the string into an array before you can reverse it.
|
||||
Your result must be a string.
|
||||
Remember to use <a href="https://www.freecodecamp.org/forum/t/how-to-get-help-when-you-are-stuck-coding/19514" target="_blank">Read-Search-Ask</a> if you get stuck. Write your own code.
|
||||
</section>
|
||||
|
||||
## Instructions
|
||||
|
||||
@ -13,7 +13,6 @@ You are given two arrays and an index.
|
||||
Use the array methods <code>slice</code> and <code>splice</code> to copy each element of the first array into the second array, in order.
|
||||
Begin inserting elements at index <code>n</code> of the second array.
|
||||
Return the resulting array. The input arrays should remain the same after the function runs.
|
||||
Remember to use <a href="https://www.freecodecamp.org/forum/t/how-to-get-help-when-you-are-stuck-coding/19514" target="_blank">Read-Search-Ask</a> if you get stuck. Write your own code.
|
||||
</section>
|
||||
|
||||
## Instructions
|
||||
|
||||
@ -10,7 +10,6 @@ forumTopicId: 16088
|
||||
<section id='description'>
|
||||
Return the provided string with the first letter of each word capitalized. Make sure the rest of the word is in lower case.
|
||||
For the purpose of this exercise, you should also capitalize connecting words like "the" and "of".
|
||||
Remember to use <a href="https://www.freecodecamp.org/forum/t/how-to-get-help-when-you-are-stuck-coding/19514" target="_blank">Read-Search-Ask</a> if you get stuck. Write your own code.
|
||||
</section>
|
||||
|
||||
## Instructions
|
||||
|
||||
@ -9,7 +9,6 @@ forumTopicId: 16089
|
||||
## Description
|
||||
<section id='description'>
|
||||
Truncate a string (first argument) if it is longer than the given maximum string length (second argument). Return the truncated string with a <code>...</code> ending.
|
||||
Remember to use <a href="https://www.freecodecamp.org/forum/t/how-to-get-help-when-you-are-stuck-coding/19514" target="_blank">Read-Search-Ask</a> if you get stuck. Write your own code.
|
||||
</section>
|
||||
|
||||
## Instructions
|
||||
|
||||
@ -11,7 +11,6 @@ forumTopicId: 16094
|
||||
Return the lowest index at which a value (second argument) should be inserted into an array (first argument) once it has been sorted. The returned value should be a number.
|
||||
For example, <code>getIndexToIns([1,2,3,4], 1.5)</code> should return <code>1</code> because it is greater than <code>1</code> (index 0), but less than <code>2</code> (index 1).
|
||||
Likewise, <code>getIndexToIns([20,3,5], 19)</code> should return <code>2</code> because once the array has been sorted it will look like <code>[3,5,20]</code> and <code>19</code> is less than <code>20</code> (index 2) and greater than <code>5</code> (index 1).
|
||||
Remember to use <a href="https://www.freecodecamp.org/forum/t/how-to-get-help-when-you-are-stuck-coding/19514" target="_blank">Read-Search-Ask</a> if you get stuck. Write your own code.
|
||||
</section>
|
||||
|
||||
## Instructions
|
||||
|
||||
@ -14,7 +14,6 @@ Calling this returned function with a single argument will then return the sum:
|
||||
<code>var sumTwoAnd = addTogether(2);</code>
|
||||
<code>sumTwoAnd(3)</code> returns <code>5</code>.
|
||||
If either argument isn't a valid number, return undefined.
|
||||
Remember to use <a href='https://www.freecodecamp.org/forum/t/how-to-get-help-when-you-are-stuck-coding/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Try to pair program. Write your own code.
|
||||
</section>
|
||||
|
||||
## Instructions
|
||||
|
||||
@ -10,7 +10,6 @@ forumTopicId: 14273
|
||||
<section id='description'>
|
||||
Return an English translated sentence of the passed binary string.
|
||||
The binary string will be space separated.
|
||||
Remember to use <a href='https://www.freecodecamp.org/forum/t/how-to-get-help-when-you-are-stuck-coding/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Try to pair program. Write your own code.
|
||||
</section>
|
||||
|
||||
## Instructions
|
||||
|
||||
@ -9,7 +9,6 @@ forumTopicId: 16007
|
||||
## Description
|
||||
<section id='description'>
|
||||
Convert the characters <code>&</code>, <code><</code>, <code>></code>, <code>"</code> (double quote), and <code>'</code> (apostrophe), in a string to their corresponding HTML entities.
|
||||
Remember to use <a href='https://www.freecodecamp.org/forum/t/how-to-get-help-when-you-are-stuck-coding/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Try to pair program. Write your own code.
|
||||
</section>
|
||||
|
||||
## Instructions
|
||||
|
||||
@ -9,7 +9,6 @@ forumTopicId: 16008
|
||||
## Description
|
||||
<section id='description'>
|
||||
Compare two arrays and return a new array with any items only found in one of the two given arrays, but not both. In other words, return the symmetric difference of the two arrays.
|
||||
Remember to use <a href='https://www.freecodecamp.org/forum/t/how-to-get-help-when-you-are-stuck-coding/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Try to pair program. Write your own code.
|
||||
<strong>Note</strong><br>You can return the array with its elements in any order.
|
||||
</section>
|
||||
|
||||
|
||||
@ -13,7 +13,6 @@ The DNA strand is missing the pairing element. Take each character, get its pair
|
||||
Return the provided character as the first element in each array.
|
||||
For example, for the input GCG, return [["G", "C"], ["C","G"],["G", "C"]]
|
||||
The character and its pair are paired up in an array, and all the arrays are grouped into one encapsulating array.
|
||||
Remember to use <a href='https://www.freecodecamp.org/forum/t/how-to-get-help-when-you-are-stuck-coding/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Try to pair program. Write your own code.
|
||||
</section>
|
||||
|
||||
## Instructions
|
||||
|
||||
@ -10,7 +10,6 @@ forumTopicId: 16010
|
||||
<section id='description'>
|
||||
Given the array <code>arr</code>, iterate through and remove each element starting from the first element (the 0 index) until the function <code>func</code> returns <code>true</code> when the iterated element is passed through it.
|
||||
Then return the rest of the array once the condition is satisfied, otherwise, <code>arr</code> should be returned as an empty array.
|
||||
Remember to use <a href='https://www.freecodecamp.org/forum/t/how-to-get-help-when-you-are-stuck-coding/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Try to pair program. Write your own code.
|
||||
</section>
|
||||
|
||||
## Instructions
|
||||
|
||||
@ -12,7 +12,6 @@ Check if the predicate (second argument) is <dfn>truthy</dfn> on all elements of
|
||||
In other words, you are given an array collection of objects. The predicate <code>pre</code> will be an object property and you need to return <code>true</code> if its value is <code>truthy</code>. Otherwise, return <code>false</code>.
|
||||
In JavaScript, <code>truthy</code> values are values that translate to <code>true</code> when evaluated in a Boolean context.
|
||||
Remember, you can access object properties through either dot notation or <code>[]</code> notation.
|
||||
Remember to use <a href='https://www.freecodecamp.org/forum/t/how-to-get-help-when-you-are-stuck-coding/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Try to pair program. Write your own code.
|
||||
</section>
|
||||
|
||||
## Instructions
|
||||
|
||||
@ -21,7 +21,6 @@ setFullName(firstAndLast)
|
||||
Run the tests to see the expected output for each method.
|
||||
The methods that take an argument must accept only one argument and it has to be a string.
|
||||
These methods must be the only available means of interacting with the object.
|
||||
Remember to use <a href='https://www.freecodecamp.org/forum/t/how-to-get-help-when-you-are-stuck-coding/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Try to pair program. Write your own code.
|
||||
</section>
|
||||
|
||||
## Instructions
|
||||
|
||||
@ -12,7 +12,6 @@ The array will contain objects in the format <code>{name: 'name', avgAlt: avgAlt
|
||||
You can read about orbital periods <a href="http://en.wikipedia.org/wiki/Orbital_period" target='_blank'>on Wikipedia</a>.
|
||||
The values should be rounded to the nearest whole number. The body being orbited is Earth.
|
||||
The radius of the earth is 6367.4447 kilometers, and the GM value of earth is 398600.4418 km<sup>3</sup>s<sup>-2</sup>.
|
||||
Remember to use <a href='https://www.freecodecamp.org/forum/t/how-to-get-help-when-you-are-stuck-coding/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Try to pair program. Write your own code.
|
||||
</section>
|
||||
|
||||
## Instructions
|
||||
|
||||
@ -10,7 +10,6 @@ forumTopicId: 16023
|
||||
<section id='description'>
|
||||
Find the missing letter in the passed letter range and return it.
|
||||
If all letters are present in the range, return undefined.
|
||||
Remember to use <a href='https://www.freecodecamp.org/forum/t/how-to-get-help-when-you-are-stuck-coding/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Try to pair program. Write your own code.
|
||||
</section>
|
||||
|
||||
## Instructions
|
||||
|
||||
@ -13,7 +13,6 @@ Translate the provided string to pig latin.
|
||||
If a word begins with a vowel you just add "way" to the end.
|
||||
If a word does not contain a vowel, just add "ay" to the end.
|
||||
Input strings are guaranteed to be English words in all lowercase.
|
||||
Remember to use <a href='https://www.freecodecamp.org/forum/t/how-to-get-help-when-you-are-stuck-coding/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Try to pair program. Write your own code.
|
||||
</section>
|
||||
|
||||
## Instructions
|
||||
|
||||
@ -13,7 +13,6 @@ First argument is the sentence to perform the search and replace on.
|
||||
Second argument is the word that you will be replacing (before).
|
||||
Third argument is what you will be replacing the second argument with (after).
|
||||
<strong>Note</strong><br> Preserve the case of the first character in the original word when you are replacing it. For example if you mean to replace the word "Book" with the word "dog", it should be replaced as "Dog"
|
||||
Remember to use <a href='https://www.freecodecamp.org/forum/t/how-to-get-help-when-you-are-stuck-coding/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Try to pair program. Write your own code.
|
||||
</section>
|
||||
|
||||
## Instructions
|
||||
|
||||
@ -10,7 +10,6 @@ forumTopicId: 16046
|
||||
<section id='description'>
|
||||
You will be provided with an initial array (the first argument in the destroyer function), followed by one or more arguments. Remove all elements from the initial array that are of the same value as these arguments.
|
||||
<strong>Note</strong><br> You have to use the <code>arguments</code> object.
|
||||
Remember to use <a href="https://www.freecodecamp.org/forum/t/how-to-get-help-when-you-are-stuck-coding/19514" target="_blank">Read-Search-Ask</a> if you get stuck. Write your own code.
|
||||
</section>
|
||||
|
||||
## Instructions
|
||||
|
||||
@ -11,7 +11,6 @@ forumTopicId: 16075
|
||||
Find the smallest common multiple of the provided parameters that can be evenly divided by both, as well as by all sequential numbers in the range between these parameters.
|
||||
The range will be an array of two numbers that will not necessarily be in numerical order.
|
||||
For example, if given 1 and 3, find the smallest common multiple of both 1 and 3 that is also evenly divisible by all numbers <em>between</em> 1 and 3. The answer here would be 6.
|
||||
Remember to use <a href='https://www.freecodecamp.org/forum/t/how-to-get-help-when-you-are-stuck-coding/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Try to pair program. Write your own code.
|
||||
</section>
|
||||
|
||||
## Instructions
|
||||
|
||||
@ -12,7 +12,6 @@ Write a function that takes two or more arrays and returns a new array of unique
|
||||
In other words, all values present from all arrays should be included in their original order, but with no duplicates in the final array.
|
||||
The unique numbers should be sorted by their original order, but the final array should not be sorted in numerical order.
|
||||
Check the assertion tests for examples.
|
||||
Remember to use <a href='https://www.freecodecamp.org/forum/t/how-to-get-help-when-you-are-stuck-coding/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Try to pair program. Write your own code.
|
||||
</section>
|
||||
|
||||
## Instructions
|
||||
|
||||
@ -9,7 +9,6 @@ forumTopicId: 16078
|
||||
## Description
|
||||
<section id='description'>
|
||||
Convert a string to spinal case. Spinal case is all-lowercase-words-joined-by-dashes.
|
||||
Remember to use <a href='https://www.freecodecamp.org/forum/t/how-to-get-help-when-you-are-stuck-coding/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Try to pair program. Write your own code.
|
||||
</section>
|
||||
|
||||
## Instructions
|
||||
|
||||
@ -9,7 +9,6 @@ forumTopicId: 16079
|
||||
## Description
|
||||
<section id='description'>
|
||||
Flatten a nested array. You must account for varying levels of nesting.
|
||||
Remember to use <a href='https://www.freecodecamp.org/forum/t/how-to-get-help-when-you-are-stuck-coding/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Try to pair program. Write your own code.
|
||||
</section>
|
||||
|
||||
## Instructions
|
||||
|
||||
@ -12,7 +12,6 @@ We'll pass you an array of two numbers. Return the sum of those two numbers plus
|
||||
|
||||
For example, <code>sumAll([4,1])</code> should return <code>10</code> because sum of all the numbers between 1 and 4 (both inclusive) is <code>10</code>.
|
||||
|
||||
Remember to use <a href='https://www.freecodecamp.org/forum/t/how-to-get-help-when-you-are-stuck-coding/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Try to pair program. Write your own code.
|
||||
|
||||
</section>
|
||||
|
||||
|
||||
@ -11,7 +11,6 @@ forumTopicId: 16084
|
||||
Given a positive integer <code>num</code>, return the sum of all odd Fibonacci numbers that are less than or equal to <code>num</code>.
|
||||
The first two numbers in the Fibonacci sequence are 1 and 1. Every additional number in the sequence is the sum of the two previous numbers. The first six numbers of the Fibonacci sequence are 1, 1, 2, 3, 5 and 8.
|
||||
For example, <code>sumFibs(10)</code> should return <code>10</code> because all odd Fibonacci numbers less than or equal to <code>10</code> are 1, 1, 3, and 5.
|
||||
Remember to use <a href='https://www.freecodecamp.org/forum/t/how-to-get-help-when-you-are-stuck-coding/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Try to pair program. Write your own code.
|
||||
</section>
|
||||
|
||||
## Instructions
|
||||
|
||||
@ -16,7 +16,6 @@ contrast, 4 is not prime since it is divisible by 1, 2 and 4.
|
||||
Rewrite `sumPrimes` so it returns the sum of all prime numbers that are less than or
|
||||
equal to num.
|
||||
|
||||
Remember to use <a href='https://www.freecodecamp.org/forum/t/how-to-get-help-when-you-are-stuck-coding/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Try to pair program. Write your own code.
|
||||
</section>
|
||||
|
||||
## Instructions
|
||||
|
||||
@ -10,7 +10,6 @@ forumTopicId: 16092
|
||||
<section id='description'>
|
||||
Make a function that looks through an array of objects (first argument) and returns an array of all objects that have matching name and value pairs (second argument). Each name and value pair of the source object has to be present in the object from the collection if it is to be included in the returned array.
|
||||
For example, if the first argument is <code>[{ first: "Romeo", last: "Montague" }, { first: "Mercutio", last: null }, { first: "Tybalt", last: "Capulet" }]</code>, and the second argument is <code>{ last: "Capulet" }</code>, then you must return the third object from the array (the first argument), because it contains the name and its value, that was passed on as the second argument.
|
||||
Remember to use <a href='https://www.freecodecamp.org/forum/t/how-to-get-help-when-you-are-stuck-coding/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Write your own code.
|
||||
</section>
|
||||
|
||||
## Instructions
|
||||
|
||||
@ -12,7 +12,6 @@ One of the simplest and most widely known <dfn>ciphers</dfn> is a <dfn>Caesar ci
|
||||
A common modern use is the <a href="https://en.wikipedia.org/wiki/ROT13" target='_blank'>ROT13</a> cipher, where the values of the letters are shifted by 13 places. Thus 'A' ↔ 'N', 'B' ↔ 'O' and so on.
|
||||
Write a function which takes a <a href="https://en.wikipedia.org/wiki/ROT13" target='_blank'>ROT13</a> encoded string as input and returns a decoded string.
|
||||
All letters will be uppercase. Do not transform any non-alphabetic character (i.e. spaces, punctuation), but do pass them on.
|
||||
Remember to use <a href='https://www.freecodecamp.org/forum/t/how-to-get-help-when-you-are-stuck-coding/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Try to pair program. Write your own code.
|
||||
</section>
|
||||
|
||||
## Instructions
|
||||
|
||||
@ -14,7 +14,6 @@ The <code>checkCashRegister()</code> function should always return an object wit
|
||||
Return <code>{status: "INSUFFICIENT_FUNDS", change: []}</code> if cash-in-drawer is less than the change due, or if you cannot return the exact change.
|
||||
Return <code>{status: "CLOSED", change: [...]}</code> with cash-in-drawer as the value for the key <code>change</code> if it is equal to the change due.
|
||||
Otherwise, return <code>{status: "OPEN", change: [...]}</code>, with the change due in coins and bills, sorted in highest to lowest order, as the value of the <code>change</code> key.
|
||||
Remember to use <a href='https://www.freecodecamp.org/forum/t/how-to-get-help-when-you-are-stuck-coding/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Try to pair program. Write your own code.
|
||||
<table class='table table-striped'><tr><th>Currency Unit</th><th>Amount</th></tr><tr><td>Penny</td><td>$0.01 (PENNY)</td></tr><tr><td>Nickel</td><td>$0.05 (NICKEL)</td></tr><tr><td>Dime</td><td>$0.1 (DIME)</td></tr><tr><td>Quarter</td><td>$0.25 (QUARTER)</td></tr><tr><td>Dollar</td><td>$1 (DOLLAR)</td></tr><tr><td>Five Dollars</td><td>$5 (FIVE)</td></tr><tr><td>Ten Dollars</td><td>$10 (TEN)</td></tr><tr><td>Twenty Dollars</td><td>$20 (TWENTY)</td></tr><tr><td>One-hundred Dollars</td><td>$100 (ONE HUNDRED)</td></tr></table>
|
||||
</section>
|
||||
|
||||
|
||||
@ -13,7 +13,6 @@ A <dfn>palindrome</dfn> is a word or sentence that's spelled the same way both f
|
||||
<strong>Note</strong><br>You'll need to remove <strong>all non-alphanumeric characters</strong> (punctuation, spaces and symbols) and turn everything into the same case (lower or upper case) in order to check for palindromes.
|
||||
We'll pass strings with varying formats, such as <code>"racecar"</code>, <code>"RaceCar"</code>, and <code>"race CAR"</code> among others.
|
||||
We'll also pass strings with special symbols, such as <code>"2A3*3a2"</code>, <code>"2A3 3a2"</code>, and <code>"2_A3*3#A2"</code>.
|
||||
Remember to use <a href="https://www.freecodecamp.org/forum/t/how-to-get-help-when-you-are-stuck-coding/19514" target="_blank">Read-Search-Ask</a> if you get stuck. Write your own code.
|
||||
</section>
|
||||
|
||||
## Instructions
|
||||
|
||||
@ -10,7 +10,6 @@ forumTopicId: 16044
|
||||
<section id='description'>
|
||||
Convert the given number into a roman numeral.
|
||||
All <a href="http://www.mathsisfun.com/roman-numerals.html" target="_blank">roman numerals</a> answers should be provided in upper-case.
|
||||
Remember to use <a href='https://www.freecodecamp.org/forum/t/how-to-get-help-when-you-are-stuck-coding/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Try to pair program. Write your own code.
|
||||
</section>
|
||||
|
||||
## Instructions
|
||||
|
||||
@ -12,7 +12,6 @@ Return <code>true</code> if the passed string looks like a valid US phone number
|
||||
The user may fill out the form field any way they choose as long as it has the format of a valid US number. The following are examples of valid formats for US numbers (refer to the tests below for other variants):
|
||||
<blockquote>555-555-5555<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 <code>800-692-7753</code> or <code>8oo-six427676;laskdjf</code>. Your job is to validate or reject the US phone number based on any combination of the formats provided above. The area code is required. If the country code is provided, you must confirm that the country code is <code>1</code>. Return <code>true</code> if the string is a valid US phone number; otherwise return <code>false</code>.
|
||||
Remember to use <a href='https://www.freecodecamp.org/forum/t/how-to-get-help-when-you-are-stuck-coding/19514' target='_blank'>Read-Search-Ask</a> if you get stuck. Try to pair program. Write your own code.
|
||||
</section>
|
||||
|
||||
## Instructions
|
||||
|
||||
Reference in New Issue
Block a user