Longest Common Prefix

CodeChefOpen on judge ↗

Write a function to find the longest common prefix string amongst an array of strings. If there is no common prefix, return -1. ###Input: - array of strings each in a line ###Output: Print the Longest Common Prefix ###Constraints - all are in lower case letters(a-z) - $1 \leq $n$ \leq 3$ ###Sample Input: ["flower","flow","flight"] ###Sample Output: fl

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