This problem requires the implementation of a basic stemming algorithm. **Example:** Input: ['running', 'jumps', 'happiness'], Output: ['run', 'jump', 'happi']. **Constraints:** The input list will contain only lowercase English letters and will not be empty.
Test Cases
Test Case 1
Input:
['running', 'jumps', 'happiness']Expected:
['run', 'jump', 'happi']Test Case 2
Input:
['happy', 'happier', 'happiest']Expected:
['happi', 'happi', 'happi']+ 3 hidden test cases