INFOSYS EXAM SOLUTIONS

long long solve(int n,int low,int high,vector<int>& arr){ long long res=0,cur=0,MOD=1000000007; for(int i=0;i<n;i++){ if(arr[i]>=low && arr[i]<=high){ cur++; }else{ res=(res + (cur*(cur+1))/2)%MOD; cur=0; } } res=(res + (cur*(cur+1))/2)%MOD; return res; }

Ready ♥️

2pm slot available Contact @srksvk

https://t.me/coding_are Share this group ✅

import sys NEG_INF = -10**18 def solve(N: int, B: int, a: list) -> int: pos = NEG_INF neg = NEG_INF for x in a: if x > 0: pos = max(pos, x, neg + x + B) else: neg = max(neg, x, pos + x + B) return max(0, pos, neg) if name == "main": data = list(map(int, sys.stdin.read().split())) N = data[0] B = data[1] a = data[2:2+N] print(solve(N, B, a))

https://t.me/coding_are Share this group with your friends and college group.. I will upload next answer in 5min

All passed ✅ import sys from collections import Counter def solve(N: int, C: int, A: list, W: list) -> int: mp = {} comp = [] for x in A: if x not in mp: mp[x] = len(mp) comp.append(mp[x]) A = comp freq = Counter(A) ans = max(W) B = 700 max_light = 1 for f in freq.values(): if f <= B and f > max_light: max_light = f max_len = min(N, 2 * max_light - 1) cnt = [0] * (len(mp) + 1) for l in range(N): total = 0 mx = 0 touched = [] end = min(N, l + max_len) for r in range(l, end): x = A[r] total += W[r] if cnt[x] == 0: touched.append(x) cnt[x] += 1 if cnt[x] > mx: mx = cnt[x] if mx * 2 > r - l + 1 and total > ans: ans = total for x in touched: cnt[x] = 0 heavy = [x for x, f in freq.items() if f > B] size = 2 * N + 5 off = N + 2 INF = 10**30 for cat in heavy: bit = [INF] * (size + 2) def update(i, val): while i <= size: if val < bit[i]: bit[i] = val i += i & -i def query(i): res = INF while i > 0: if bit[i] < res: res = bit[i] i -= i & -i return res bal = 0 pref = 0 update(off, 0) for i in range(N): pref += W[i] if A[i] == cat: bal += 1 else: bal -= 1 best = query(bal + off - 1) if best != INF: val = pref - best if val > ans: ans = val update(bal + off, pref) return ans if name == "main": data = list(map(int, sys.stdin.read().split())) idx = 0 N = data[idx]; idx += 1 C = data[idx]; idx += 1 A = data[idx:idx + N]; idx += N W = data[idx:idx + N] print(solve(N, C, A, W)) All passed ✅

import sys from collections import deque input = sys.stdin.readline def solve(N: int, F: int, MAX: int, s: list) -> int: limit = min(N, F + 1) dp = [-10**30] * limit dp[0] = s[0] dq = deque([0]) ans = dp[0] for i in range(1, limit): while dq and dq[0] < i - MAX: dq.popleft() dp[i] = s[i] + dp[dq[0]] ans = max(ans, dp[i]) while dq and dp[dq[-1]] <= dp[i]: dq.pop() dq.append(i) return ans if name == "main": data = list(map(int, sys.stdin.read().split())) idx = 0 N = data[idx]; idx += 1 F = data[idx]; idx += 1 MAX = data[idx]; idx += 1 s = data[idx:idx + N] print(solve(N, F, MAX, s))

Next answer in 5min Give ♥️

https://t.me/coding_are Share this group with your friends and college group.. I will upload next answer in 5min

Check function name then write

import sys sys.setrecursionlimit(2000) input = sys.stdin.read def solve(N: int, S: str, w: list) -> int: if N == 0: return 0 dp = [[0] * N for _ in range(N)] for i in range(N): dp[i][i] = w[i] for length in range(2, N + 1): for i in range(N - length + 1): j = i + length - 1 if S[i] == S[j]: if length == 2: dp[i][j] = w[i] + w[j] else: dp[i][j] = dp[i+1][j-1] + w[i] + w[j] else: dp[i][j] = max(dp[i+1][j], dp[i][j-1]) return dp[0][N-1] if name == "main": data = input().split() if data: N = int(data[0]) S = data[1] w = list(map(int, data[2:])) result = solve(N, S, w) print(result)

Next answer in 5min Give ♥️

Lowercase import sys sys.setrecursionlimit(2000) input = sys.stdin.read def solve(N: int, S: str, w: list) -> int: if N == 0: return 0 dp = [[0] * N for _ in range(N)] for i in range(N): dp[i][i] = w[i] for length in range(2, N + 1): for i in range(N - length + 1): j = i + length - 1 if S[i] == S[j]: if length == 2: dp[i][j] = w[i] + w[j] else: dp[i][j] = dp[i+1][j-1] + w[i] + w[j] else: dp[i][j] = max(dp[i+1][j], dp[i][j-1]) return dp[0][N-1] if name == "main": data = input().split() if data: N = int(data[0]) S = data[1] w = list(map(int, data[2:])) result = solve(N, S, w) print(result)

13.3k after i will post ✅ All tests passed code will Upload again

https://t.me/coding_are Share this group with your friends and college group.. I will upload next answer in 5min

import sys input = sys.stdin.readline def solve(n: int, l: int, a: list) -> int: if len(a) < n: a += list(map(int, sys.stdin.read().split())) cur = 1 ans = 1 for i in range(1, n): if abs(a[i] - a[i - 1]) <= l: cur += 1 else: cur = 1 ans = max(ans, cur) return ans Write with function

Next answer in 5min Give ♥️

https://t.me/coding_are Share this group with your friends and college group.. I will upload next answer in 5min

import sys input = sys.stdin.readline def solve(S: str) -> int: def cost(ch): pos = [i for i, c in enumerate(S) if c == ch] k = len(pos) if k <= 1: return 0 q = [pos[i] - i for i in range(k)] m = q[k // 2] return sum(abs(x - m) for x in q) return min(cost('0'), cost('1')) Full passed ✅