KPIT EXAM SOLUTIONS
Open in Telegram
🔥Guys plz Stop fearing for daily exams 📝 👨💻 @srksvk is here to help you all at lowest cost possible.💪 🌀 ” Our Only Aim Is To Let Get Placed To You In A Reputed Company 🔥Effort from our side = 💯 📱Main Channel: @coding_are 📱Tel I'd : @srksvk
Show more📈 Analytical overview of Telegram channel KPIT EXAM SOLUTIONS
Channel KPIT EXAM SOLUTIONS (@coding_are) in the English language segment is an active participant. Currently, the community unites 14 152 subscribers, ranking 14 030 in the Education category and 28 046 in the India region.
📊 Audience metrics and dynamics
Since its creation on невідомо, the project has demonstrated rapid growth, gathering an audience of 14 152 subscribers.
According to the latest data from 17 September, 2026, the channel demonstrates stable activity. Although there has been a change in the number of participants by -126 over the last 30 days and by -13 over the last 24 hours, overall reach remains high.
- Verification status: Not verified
- Engagement rate (ER): The average audience engagement rate is 4.44%. Within the first 24 hours after publication, content typically collects 1.62% reactions from the total number of subscribers.
- Post reach: On average, each post receives 629 views. Within the first day, a publication typically gains 229 views.
- Reactions and interaction: The audience actively supports content: the average number of reactions per post is 1.
- Thematic interests: Content is focused on key topics such as placement, gaurntee, suree, capgemini, infosy.
📝 Description and content policy
The author describes the resource as a platform for expressing subjective opinions:
“🔥Guys plz Stop fearing for daily exams 📝
👨💻 @srksvk is here to help you all at lowest cost possible.💪
🌀 ” Our Only Aim Is To Let Get Placed To You In A Reputed Company
🔥Effort from our side = 💯
📱Main Channel: @coding_are
📱Tel I'd : @srks...”
Thanks to the high frequency of updates (latest data received on 18 September, 2026), the channel maintains relevance and a high level of publication reach. Analytics show that the audience actively interacts with content, making it an important point of influence in the Education category.
14 152
Subscribers
-1324 hours
-117 days
-12630 days
Posts Archive
14 148
import sys
input = sys.stdin.readline
def solve(N: int, C1: int, C2: int, C3: int, penalties: list) -> int:
INF = 10**30
dp = [INF] * (N + 1)
dp[0] = 0
for i in range(1, N + 1):
dp[i] = min(dp[i], dp[i - 1] + C1 + penalties[i - 1])
if i >= 2:
dp[i] = min(dp[i], dp[i - 2] + C2 + penalties[i - 2])
if i >= 3:
dp[i] = min(dp[i], dp[i - 3] + C3 + penalties[i - 3])
return dp[N]
14 148
import java.util.*;
class Main {
public static int solve(int n,int k,int[] v,int[] w){
long sumA=0,sumB=0;
ArrayList<Integer> list=new ArrayList<>();
for(int i=0;i<n;i++){
if(v[i]==1)sumA+=w[i];
else sumB+=w[i];
list.add(w[i]);
}
if(sumA>sumB)return 0;
Collections.sort(list,Collections.reverseOrder());
int ops=0;
for(int x:list){
if(ops==k)break;
sumA+=x;
sumB-=x;
ops++;
if(sumA>sumB)return ops;
}
return -1;
}
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int k=sc.nextInt();
int[] v=new int[n];
for(int i=0;i<n;i++)v[i]=sc.nextInt();
int[] w=new int[n];
for(int i=0;i<n;i++)w[i]=sc.nextInt();
System.out.println(solve(n,k,v,w));
}
}14 148
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;
}
14 148
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))
14 148
https://t.me/coding_are
Share this group with your friends and college group..
I will upload next answer in 5min
14 148
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 ✅
14 148
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))
14 148
https://t.me/coding_are
Share this group with your friends and college group..
I will upload next answer in 5min
14 148
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)
14 148
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)
