Morningstar MDP help done ✅

All placement help available

All placement help available

Batch : 2024 & 2025

def lcp_len(s1, s2):
    m = min(len(s1), len(s2))
    for i in range(m):
        if s1[i] != s2[i]:
            return i
    return m

def max_lcp_len(strs):
    if not strs:
        return 0
        
    max_len = 0
    n = len(strs)
    
    for i in range(n):
        for j in range(i + 1, n):
            len_lcp = lcp_len(strs[i], strs[j])
            max_len = max(max_len, len_lcp)
    
    return max_len

def solve(N, arr):
    res = []
    for i in range(N):
        rem_strs = arr[:i] + arr[i+1:]
        max_len = max_lcp_len(rem_strs)
        res.append(max_len)
    
    return res

def solve(n, nums, k, q, queries):
    from collections import deque
    dp = [0] * n
    dq = deque()

    for i in range(n):
        while dq and dq[0] < i - k:
            dq.popleft()
        if dq:
            dp[i] = max(nums[i], dp[dq[0]] + nums[i])
        else:
            dp[i] = nums[i]
        while dq and dp[dq[-1]] < dp[i]:
            dq.pop()
        dq.append(i)

    return [dp[q-1] for q in queries]