Code Breaker Jack Ryan is one of the world’s most famous cryptographers. He has been recently tasked

help
1

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Solution {

public static String longestCommonPrefix(String s1, String s2) {
    int common = 0;
    int minLength = Math.min(s1.length(), s2.length());
    while (common < minLength && s1.charAt(common) == s2.charAt(common)) {
        common++;
    }
    return s1.substring(0, common);
}

public static void main(String[] args) throws IOException {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

    int n = Integer.parseInt(br.readLine());
    String[] strings = new String[n];
    for (int i = 0; i < n; i++) {
        strings[i] = br.readLine().trim();
    }

    int q = Integer.parseInt(br.readLine());
    for (int i = 0; i < q; i++) {
        String[] query = br.readLine().split(" ");
        int x = Integer.parseInt(query[0]);
        String code = query[1];

        int maxLCP = -1;
        String lexSmallest = null;

        for (int j = 0; j < x; j++) {
            String lcp = longestCommonPrefix(strings[j], code);
            if (lcp.length() > maxLCP) {
                maxLCP = lcp.length();
                lexSmallest = strings[j];
            } else if (lcp.length() == maxLCP && strings[j].compareTo(lexSmallest) < 0) {
                lexSmallest = strings[j];
            }
        }

        System.out.println(lexSmallest);
    }
}

}

the time limit exceeding for some cases

how can i optimize it