This was a bit complex. but passed all tests

def factor(n):
    (res_list, i)=([1],2)
    while n != 1:
        if n%i == 0:
            while n%i == 0:
                n = n//i            
            res_list.append(i)
        i = i+1 if i*i <= n else n
    return res_list

Haskell

import Control.Applicative
import Control.Monad
import System.IO

largestPrime :: [Int] -> Int -> Int
largestPrime list max 
    | (length list) == 1 = max
    | otherwise = last list
    
factorize :: Int -> Int -> [Int]
factorize _ 1 = [] 
factorize m n 
    | m * m > n = [n]
    | n `mod` m == 0 = m : factorize m (n `div` m)
    | otherwise = factorize (m + 1) n


main :: IO ()
main = do
    t_temp <- getLine
    let t = read t_temp :: Int
    forM_ [1..t] $ \a0  -> do
        n_temp <- getLine
        let n = read n_temp :: Int
        let factors = factorize 2 n         
        putStrLn(show (largestPrime factors n))

can anyone make my code more optimized

import java.io.; import java.util.;

public class Solution {

public static int largestPrimeDivisor(long n) {
    int largestPrime = -1;


    while (n % 2 == 0) {
        largestPrime = 2;
        n /= 2;
    }


    for (int i = 3; i * i <= n; i += 2) {
        while (n % i == 0) {
            largestPrime = i;  
            n /= i;  // Remove the factor i from n
        }
    }


    if (n > 1) {
        largestPrime = (int) n; 
    }

    return largestPrime;
}

public static void main(String[] args) {
    Scanner in = new Scanner(System.in);
    int t = in.nextInt();  

    for (int testCaseIndex = 0; testCaseIndex < t; testCaseIndex++) {
        long n = in.nextLong();  

        int result = largestPrimeDivisor(n);
        System.out.println(result); 
    }

    in.close();
}

}

!/bin/python3

import math import os import random import re import sys

def p_fact(n): f=[] i=2 while i*i <=n: if n%i==0: f.append(i) n//=i else: i+=1 if n>1: f.append(n) return max(f)

if name == 'main': t = int(input().strip())

for t_itr in range(t):
    n = int(input().strip())
    print(p_fact(n))

You can use Unitextify for different font styles. However, the solution to problem is:

    # Start with the smallest prime factor
    factor = 2
    while factor * factor <= n:
        if n % factor == 0:
            n //= factor
        else:
            factor += 1
    return n

t = int(input("Enter number of test cases: "))
for _ in range(t):
    n = int(input())
    print(largest_prime_factor(n))