Solution #3181
Solution #3181
Conversation
mateacademy-ai-mentor
left a comment
mateacademy-ai-mentor
left a comment
There was a problem hiding this comment.
Review Summary
Great work on this task! I'm approving your solution because it correctly implements the count_occurrences function and meets all functional requirements, including case-insensitive counting.
While your loop-based approach is perfectly valid, a more concise and Pythonic way to solve this would be to use built-in string methods as suggested in the task guidelines. For future reference, you could simplify your code to a single line by combining a case-conversion method like .lower() with the .count() method. Keep up the excellent effort!
✨ Please rate this review in the Platform's notification center1. I will be grateful for your feedback! ✨
Footnotes
| count = 0 | ||
| for lett in phrase.upper(): | ||
| if lett == letter.upper(): | ||
| count += 1 | ||
| return count |
There was a problem hiding this comment.
This loop-based approach works correctly, which is great! For a more Pythonic and concise solution, as recommended in the task guidelines, you could explore Python's built-in string methods. Is there a method that can count occurrences of a substring directly?
2 participants
No description provided.