3884. First Matching Character From Both Ends

LeetCodeTwo PointersStringOpen on judge ↗

You are given a string s of length n consisting of lowercase English letters. Return the smallest index i such that s[i] == s[n - i - 1]. If no such index exists, return -1. Example 1: Input: s = "abcacbd" Output: 1 Explanation: At index i = 1, s[1] and s[5] are both 'b'. No smaller index satisfies the condition, so the answer is 1. Example 2: Input: s = "abc" Output: 1 Explanation:

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