function findLongestWord(str) {
return str.length;
}
findLongestWord('The quick brown fox jumped over the lazy dog');
Return the length of the longest word in the provided sentence.
more info:
bf details
|bf links
|hint
function palindrome(str) {
// Good luck!
return true;
}
palindrome("eye");
Return true if the given string is a palindrome. Otherwise, return false.
more info:
bf details
|bf links
|hint
Hi, I'm CamperBot! I can help you in this chatroom :smile:
find TOPIC
find all entries about topic. ex: find js
wiki TOPIC
show contents of topic pagethanks @username
send brownie points to another userabout @username
shows info on that userbonfire BONFIRENAME
info on a bonfire:speech_balloon: meet CamperBot in this room!
hint [1/8]
Make sure you've tried to hard to solve it yourself before proceeding. :construction:
type
hint
for next hint :pencil: [Contribute at the FCC Wiki]
hint [2/8]
You have to check if the string you get as an input is a palindrome and return true
if it is, and false
otherwise.
type
hint
for next hint :pencil: [Contribute at the FCC Wiki]
:star: 444 | @camperbot | http://www.freecodecamp.com/camperbot
hint [3/8]
You may use regular expressions (RegExp
) to remove unwanted characters from the string.
type
hint
for next hint :pencil: [Contribute at the FCC Wiki]
hint [4/8]
You may use Array.prototype.split
and Array.prototype.join
methods or for
loop.
type
hint
for next hint :pencil: [Contribute at the FCC Wiki]
hint [5/8]
You may lowercase the string using String.prototype.toLowerCase
.
type
hint
for next hint :pencil: [Contribute at the FCC Wiki]
hint [6/8]
Solution ahead!
type
hint
for next hint :pencil: [Contribute at the FCC Wiki]
hint [7/8]
function palindrome(str) {
var normalizedStr = str.replace(/[\W_]/g, '').toLowerCase();
var reverseStr = normalizedStr.split('').reverse().join('');
return normalizedStr === reverseStr;
}
type
hint
for next hint :pencil: [Contribute at the FCC Wiki]
hint [8/8]
function palindrome(str) {
str = str.toLowerCase().replace(/[\W_]/g, '');
for(var i = 0, len = str.length - 1; i < len/2; i++) {
if(str[i] !== str[len-i]) {
return false;
}
}
return true;
}
We use regular expressions to replace any uppercase letter into a lowercase. Then we check if the string is the same as the reversed string using split()
to split the original string by characters, then reverse and then join it back together.
If you found this page useful, you can give thanks by copying and pasting this on the main chat: Thanks @Rafase282 @abhisekp
NOTE: Please add your username only if you have added any relevant main contents to the wiki page. (Please don't remove any existing usernames.)
type
hint
for next hint :pencil: [Contribute at the FCC Wiki]
hint [1/8]
Make sure you've tried to hard to solve it yourself before proceeding. :construction:
type
hint
for next hint :pencil: [Contribute at the FCC Wiki]
hint [2/8]
You have to check if the string you get as an input is a palindrome and return true
if it is, and false
otherwise.
type
hint
for next hint :pencil: [Contribute at the FCC Wiki]
hint [3/8]
You may use regular expressions (RegExp
) to remove unwanted characters from the string.
type
hint
for next hint :pencil: [Contribute at the FCC Wiki]
function palindrome(str) {
// Good luck!
return true;
}
palindrome("eye");
Return true if the given string is a palindrome. Otherwise, return false.
more info:
bf details
|bf links
|hint
hint [1/8]
Make sure you've tried to hard to solve it yourself before proceeding. :construction:
type
hint
for next hint :pencil: [Contribute at the FCC Wiki]
hint [2/8]
You have to check if the string you get as an input is a palindrome and return true
if it is, and false
otherwise.
type
hint
for next hint :pencil: [Contribute at the FCC Wiki]
hint [3/8]
You may use regular expressions (RegExp
) to remove unwanted characters from the string.
type
hint
for next hint :pencil: [Contribute at the FCC Wiki]
function destroyer(arr) {
// Remove all the values
return arr;
}
destroyer([1, 2, 3, 1, 2, 3], 2, 3);
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.
more info:
bf details
|bf links
|hint
hint [1/8]
Make sure you've tried to hard to solve it yourself before proceeding. :construction:
type
hint
for next hint :pencil: [Contribute at the FCC Wiki]