### Introduction
You are given a string `sentence`. Your task is to implement a function that counts all the palindromic substrings in the string. A palindromic substring is a substring that reads the same backward as forward.

### Requirements
1. **Function Signature**: Implement the function `findPallindromes` that takes one parameter:
   - `sentence`: A string in which you need to count palindromic substrings.

2. **Output**: The function should return an integer representing the count of palindromic substrings in the given string.

### Example
Consider the following input string:

```javascript
let sentence = "aabbba";
```

**Expected Output**:
```javascript
Count of palindromes: 11
```

### Constraints
- The function should have a time complexity of O(n^2), where n is the length of the input string.
- The function should use O(1) additional space.

### Explanation
1. **Palindrome Counting Function**: Define a helper function `countPallindromes` that counts palindromes centered at given indices.
2. **Iterate Through the Sentence**: For each character in the sentence, count palindromes centered at that character (odd-length palindromes) and between that character and the next character (even-length palindromes).
3. **Sum of Counts**: Return the total count of palindromic substrings.

### Example Walkthrough
For the input string `"aabbba"`:
1. Palindromic substrings of length 1: "a", "a", "b", "b", "b", "a" (6 substrings)
2. Palindromic substrings of length 2: "aa", "bb", "bb" (3 substrings)
3. Palindromic substrings of length 3: "bbb" (1 substring)
4. Palindromic substrings of length 5: "abbba" (1 substring)

Total palindromic substrings: 6 + 3 + 1 + 1 = 11

### Algorithm
1. **Initialization**: Initialize a variable to count the palindromic substrings.
2. **Helper Function**: Define `countPallindromes` to count palindromes centered at given indices.
3. **Main Function**: For each character in the string, use the helper function to count palindromes centered at that character and between that character and the next character.
4. **Return Result**: Return the total count of palindromic substrings.

### Function Signature
```javascript
function countPallindromes(sentence, left, right) {
   // your code here
}

function findPallindromes(sentence) {
   // your code here
}

export { findPallindromes }
```

complete.test.js

index.js

partial.test.js

Count Palindromes in string

### Introduction
Counting palindromic substrings in a given string is a common problem in string manipulation. A palindromic substring is a substring that reads the same backward as forward. The challenge is to efficiently identify and count all such substrings within the string. There are two types of palindromic substrings: odd-length palindromes (with a single center character) and even-length palindromes (with two center characters).

### Problem Restatement
Given a string `sentence`, implement a function `findPallindromes` that counts all the palindromic substrings in the string. The function should return the total count of such substrings.

### Requirements
1. **Function Signature**: Implement the function `findPallindromes` that takes one parameter:
   - `sentence`: A string in which you need to count palindromic substrings.

2. **Output**: The function should return an integer representing the count of palindromic substrings in the given string.

### Example
Consider the following input string:

```javascript
let sentence = "aabbba";
```

**Expected Output**:
```javascript
Count of palindromes: 11
```

### Constraints
- The function should have a time complexity of O(n^2), where n is the length of the input string.
- The function should use O(1) additional space.

### Explanation
To solve this problem, we use a center-expansion technique. We consider each character and each pair of characters in the string as the center of potential palindromic substrings. By expanding around these centers, we can count all palindromic substrings efficiently.

1. **Palindrome Counting Function**: Define a helper function `countPallindromes` that counts palindromes centered at given indices.
2. **Iterate Through the Sentence**: For each character in the sentence, count palindromes centered at that character (odd-length palindromes) and between that character and the next character (even-length palindromes).
3. **Sum of Counts**: Return the total count of palindromic substrings.

### Types of Palindromes
1. **Odd-Length Palindromes**: These palindromes have a single center character. For example, in the string `"aba"`, the center is the character `"b"`.
2. **Even-Length Palindromes**: These palindromes have two center characters. For example, in the string `"abba"`, the centers are the characters `"bb"`.

### Example Walkthrough
For the input string `"aabbba"`:
1. Palindromic substrings of length 1: "a", "a", "b", "b", "b", "a" (6 substrings)
2. Palindromic substrings of length 2: "aa", "bb", "bb" (3 substrings)
3. Palindromic substrings of length 3: "bbb" (1 substring)
4. Palindromic substrings of length 5: "abbba" (1 substring)

Total palindromic substrings: 6 + 3 + 1 + 1 = 11

### Algorithm
1. **Initialization**: Initialize a variable to count the palindromic substrings.
2. **Helper Function**: Define `countPallindromes` to count palindromes centered at given indices.
3. **Main Function**: For each character in the string, use the helper function to count palindromes centered at that character and between that character and the next character.
4. **Return Result**: Return the total count of palindromic substrings.

### Code Implementation

Here is the code for the `findPallindromes` function:

```javascript
function countPallindromes(sentence, left, right) {
    let count = 0;
    while(left >= 0 && right < sentence.length && sentence[left] == sentence[right]) {
        count++;
        left--;
        right++;
    }
    return count;
}

function findPallindromes(sentence) {
    let count = 0;
    for (let i = 0; i < sentence.length; i++) {
        count += countPallindromes(sentence, i, i); // Count odd-length palindromes
        count += countPallindromes(sentence, i, i + 1); // Count even-length palindromes
    }
    return count;
}

export { findPallindromes }
```

### Explanation of the Code

- **countPallindromes Function**: This helper function counts palindromic substrings centered at the indices `left` and `right`.
  - It uses a while loop to expand outwards from the center, checking for equality and counting palindromes.
- **findPallindromes Function**: This function iterates through each character in the string and uses the helper function to count palindromes centered at each character and between each pair of characters.
  - It sums the counts from the helper function and returns the total.

### Conclusion
The solution efficiently counts all palindromic substrings in a given string using a center-expansion approach. This approach ensures that the function operates in O(n^2) time complexity with O(1) additional space, meeting the problem's constraints. The center-expansion method is both intuitive and effective for identifying palindromic substrings.

Nothing to see here! Please run tests.