forked from sf-wdi-30/problem-set-js-basics
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathpalindrome-detector.js
74 lines (68 loc) · 2 KB
/
palindrome-detector.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
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
67
68
69
70
71
72
73
74
/*
Palindrome Detector
Create a function `isPalindrome` that returns a boolean indicating whether a given string is a palindrome.
Here are some examples of palindromes (from easiest to hardest, try to get as many as you can!):
TRUE:
- mom
- racecar
- stack cats
- Pull up if I pull up
- Amore, Roma.
- A man, a plan, a canal: Panama.
FALSE:
- these
- will not
- work!
*/
// YOUR CODE HERE
function isPalindrome (n){
palindromeForward = n.split('');
palindromeInitial = palindromeForward;
palindromeReverse = n.split('');
reverse = palindromeReverse.reverse();
for (var i = 0; i < palindromeInitial.length; i++ ) {
if (palindromeForward[i]=== " "){
palindromeForward.splice(i,1);
}
}
for (var i = 0; i < palindromeInitial.length; i++ ) {
if (palindromeForward[i]=== ","){
palindromeForward.splice(i,1);
}
}
for (var i = 0; i < palindromeInitial.length; i++ ) {
if (palindromeForward[i]=== "."){
palindromeForward.splice(i,1);
}
}
for (var i = 0; i < palindromeInitial.length; i++ ) {
if (palindromeForward[i]=== ":"){
palindromeForward.splice(i,1);
}
}
for (var i = 0; i < palindromeReverse.length; i++ ) {
if (palindromeReverse[i]=== " "){
palindromeReverse.splice(i,1);
}
}
for (var i = 0; i < palindromeReverse.length; i++ ) {
if (palindromeReverse[i]=== ","){
palindromeReverse.splice(i,1);
}
}
for (var i = 0; i < palindromeReverse.length; i++ ) {
if (palindromeReverse[i]=== "."){
palindromeReverse.splice(i,1);
}
}
for (var i = 0; i < palindromeReverse.length; i++ ) {
if (palindromeReverse[i]=== ":"){
palindromeReverse.splice(i,1);
}
}
stringForward = palindromeForward.join('');
stringBackward = palindromeReverse.join('');
forward = stringForward.toLowerCase();
backward = stringBackward.toLowerCase();
return (forward === backward)
}