-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathstringPaliCheck.js
71 lines (54 loc) · 1.29 KB
/
stringPaliCheck.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
/*
Problem statement - To find a string permutation is pallindrome.
*/
function stringPaliCheck(string){
const lengthofString = string.length
const stringObj = {}
let count = 0
if(lengthofString === 1){
return true
}
else if(lengthofString % 2 === 0){
for(let i of string){
if(i in stringObj){
stringObj[i] +=1
}
else{
stringObj[i] = 1
}
}
for(let i in stringObj){
if(stringObj[i] %2==0){
continue
}
else{
return false
}
}
return true
}
else if(lengthofString % 2 !== 0){
for(let i of string){
if(i in stringObj){
stringObj[i] +=1
}
else{
stringObj[i] = 1
}
}
for(let i in stringObj){
if(stringObj[i]%2!=0){
count +=1
if(count == 1){
console.log("Inside")
continue
}
else{
console.log("Inside else")
return false
}
}
}
return true
}
}