public class Solution {

    /**

     * @param strs: A list of strings

     * @return: The longest common prefix

     */

    public String longestCommonPrefix(String[] strs) {

        // write your code here

        if(strs.length == 0){

            return "";

        }

        String prefix = strs[0];

        int i = 0;

        int j = 0;

        for ( i=1;i<strs.length;i++){

            if(strs[i].length() == 0){

                return "";

            }

            for( j=0;j<prefix.length();j++){

                if(strs[i].charAt(j) != prefix.charAt(j)){

                    prefix = prefix.substring(0,j);

                }

            }

        }

        return prefix;

    }

}