← All problemsSign in

First and Last

Given an array of $N$ words, count the number of words such that the first and last character is same. The string $"aaba"$ has the first and last character same while the string $"aabc"$ do not have the first and last character same. ###Input: - First line contains a single integer $N$. - The second line contains $N$ space separated words containing only lowercase English letters. ###

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start