Coding | EXAMS | IBM ACCENTURE | VIRTUSA | IBM | AMAZON | TCS | EPAM | WILEY EDGE | TECH MAHINDRA | JPMORGAN | HCL | WIPRO
Ir al canal en Telegram
Main channel https://t.me/Coding_000 Contact Admin 👉 @ILOVEU_143 for booking your exam slots Web- https://coding000.github.io/Projects/ 💯% clearance in any placement exams OffCampus -https://t.me/Offcampus_000 Discussion- https://t.me/exams_discussion
Mostrar más3 352
Suscriptores
-524 horas
-147 días
-4530 días
Archivo de publicaciones
KREETI TECHNOLOGIES EXAM Tomorrow SOLUTION GROUP:
1)https://t.me/exams_discussion
2)https://t.me/kreeticoding000
share to your friends ✅❤️
KREETI TECHNOLOGIES EXAM Tomorrow SOLUTION GROUP:
1)https://t.me/exams_discussion
2)https://t.me/kreeticoding000
share to your friends ✅❤️
share ur questions here..👇👇
Kreethi technology Solutions 👇👇
https://t.me/exams_discussion
https://t.me/exams_discussion
AnimatedSticker.tgs0.02 KB
def s(ind,A):
if ind > len(A) or ind<0:
return 0
i=ind-1
j-ind+1
ans=1
while i>=0 and j<len(A) and A[i]==A[j]:
ans+=2
i-=1
j+=1
return ans
class Solution:
# @ILOVEU_143 A : string
# @ILOVEU_143 B : list of integers
# a list of integers
def solve(self, A, B):
ans=[]
for i in B:
val = s(i-1,A)
ans.append(val)
return ans
3rd code in python
Trilogy exam answers
def s(ind,A):
if ind > len(A) or ind<0:
return 0
i=ind-1
j-ind+1
ans=1
while i>=0 and j<len(A) and A[i]==A[j]:
ans+=2
i-=1
j+=1
return ans
class Solution:
# @ILOVEU_143 : string
# @ILOVEU_143 B : list of integers
# @return a list of integers
def solve(self, A, B):
ans=[]
for i in B:
val = s(i-1,A)
ans.append(val)
return ans
3rd code in python
Trilogy exam answers
def AndSum(arr,l,r):
res= arr[l-1]
for i in range(l-1,r):
res = res & arr[i]
return res
class Solution:
A : string
B : string
an integer
def solve(self, A, B):
res=[]
for i in range(len(B)):
l1,r1,l2,r2=B[i][0],B[i][1],B[i][2],B[i][3]
res.append(AndSum(A,l1,r1) ^ AndSum(A,l2,r2))
return res
2nd in Python
Trilogy exam answers
def fun(i):
l=[]
ans=0
maxi,mini=-99999999,99999999
while i!=0:
maxi=max(maxi,i%10)
mini=min(mini,i%10)
ans^=(i%10)
i//=10
#Coding_000
return ans>((mini+maxi)/2)
class Solution:
# @param A : string
# @param B : string
# @return an integer
def solve(self, A, B):
ans=0
for i in range(int(A),int(B)+1):
ans+=fun(i)
return ans%(10**9+7)
1st in Python
Trilogy exam answers
second question trilogy -java
trilogy second question code.python ✅
#include<bits/stdc++.h>
using namespace std;
int main(){
int t;
cin>>t;
while(t--){
string str;
cin >> str;
int n = str.length(), ans = 0;
for(int i = 0; i < n; i++){
if(str[i] == '5' || str[i] == '6')
continue;
else
ans += 1;
}
cout << ans << endl;
}
return 0;
}
Beautiful Number code
C++
Share...our channel frds....i will upload next one...fast..💥💥💥
Share to ur frds...our channel
If u want more solution...
Give reaction..😍
beautiful number code -trilogy
python✅
import math
n = int(input())
a = []
for i in range(n):
a.append(int(input()))
ans = 0
for j in range(1, 1 << n):
index = 0
k = []
while(j != 0):
if (j & 1) == 1:
k.append(a[index])
index += 1
j = j >> 1
s = sum(k)
r = k[0]
for p in range(1, len(k)):
r = r | k[p]
m = (s/r)
ans = max(ans, m)
print(math.floor(ans*10000))
Beautiful number in range..✅
sent your questions...fast..
👇👇👇
https://t.me/exams_discussion
Now trilogy is exam is going on...
¡Ya disponible! Investigación de Telegram 2025 — los principales insights del año 
