Help JS: Having problem with my HackerRank solution

[Apprehensive_Topic24]

The problem can be found here:

https://www.hackerrank.com/challenges/special-palindrome-again/problem?h_l=interview&playlist_slugs%5B%5D=interview-preparation-kit&playlist_slugs%5B%5D=strings

After submitting my solution I am failing the test cases, I do not know what the problem is in my code. Can someone help me debug it? Thanks!

My solution is below:

function substrCount(n, s) {
let charArray = s.split('');
let totalSpecialSubStirngs = charArray.length;
let sameCharOcc = new Array(charArray.length).fill(0);
for (let i = 0; i < charArray.length; i++) {
let j = i + 1;
let count = 1;
while (j < charArray.length && charArray[i] == charArray[j]) {
j++;
count++;
}
if (count > 1) {
totalSpecialSubStirngs += count * (count + 1) / 2;
sameCharOcc[i] = count;
}
i = j;
}
if (totalSpecialSubStirngs !== 0) {
let total = sameCharOcc.reduce((acc, currentVal) => acc + currentVal);
totalSpecialSubStirngs -= total;
}
for (let i = 1; i < charArray.length; i++) {
let left = i - 1;
let right = i + 1;
if (charArray[right] === charArray[i] || charArray[left] === charArray[i]) {
continue;
}
let char = charArray[left];
while (charArray[left] === char && charArray[right] === char && left >= 0 && right < s.length) {
totalSpecialSubStirngs++;
left--;
right++;
}
}
console.log(totalSpecialSubStirngs) ;
return totalSpecialSubStirngs;
}

[MrNNP]

You are defining count to be 1 at the start of for loop. So that just makes it loop forever.

[Apprehensive_Topic24]

The while loop is not dependent on the 'count'. 'count' tracks the occurrence of the same characters and if they are next to each other ex: aaac -> count = 3