Coding | EXAMS | IBM ACCENTURE | VIRTUSA | IBM | AMAZON | TCS | EPAM | WILEY EDGE | TECH MAHINDRA | JPMORGAN | HCL | WIPRO

5) 70

4) 162

3)z2-yz+yx=0

2)40

1)30

Aptitude 💯 1. @Coding_000 @Coding_000 ✅✅Share our channel screenshot in large gorups for more answers ✅✅ Make 1K Subscribers for FREE codes😁😊

Get ready guys

Tcs nqt 2pm Free solutions😁 @Coding_000 ->Instructions Guys launch at 2.00 pm and click on I'm ready to begin at 2.09pm share to yours friends ❤️ @Coding_000

Guys share this group  in other groups 😁 make it 1k @Coding_000❤️ @Coding_000❤️

def longest_substring(s, k): n = len(s) if(k>1): s += s n *= 2 ans = 0 i = 0 while (i < n): x = 0 while (i < n and s[i] == '0'): x,i=x+1, i+1 ans = max(ans, x) i+=1 if(k==1 or ans!=n): return ans else: return (ans//2)*k s = "010001000" k = 4 print(longest_substring(s, k)) @Coding_000 share to your friends 😍😁

n,m,k=map(int,input().split()) t=pow(n,m) count=0 while(t>0):     r=t%10     t=t//10     count+=1     if count==k:         print(r)

Guys make 1k i will share all remaining virtusa neural hack codes & TCS nqt Solutions Share share @Coding_000 @Coding_000 @Coding_000 Share the channel link in large groups and your college what's app groups 😊😍❤️

Hello guys more 500 mem to reach 1k... Please support guys Share the channel link in large groups and your college what's app groups 😊😍❤️ @Coding_000❤️ @Coding_000❤️

n=int(input()) l,m=map(int,input().split()) k=int(input()) c=0 for i in range(1,k+1):       if i%l==0 or i%m==0:             c=c+1 print(c) @Coding_000

k=int(input()) l1=input() l1=list(map(int,l1)) for i in range(k):     max1=0     for j in range(i,len(l1)):         if max1<l1[j]:             max1=l1[j]             element=j     if element!=i:         l1[i],l1[element]=l1[element],l1[i] print("".join(map(str,l1))) @Coding_000 python-Virtusa neural hack

import itertools from heapq import merge def nth_hamming_number(n):     def num_recur():         last = 1         yield last         x, y, z = itertools.tee(num_recur(), 3)         for n in merge((2 * i for i in x), (3 * i for i in y), (5 * i for i in z)):             if n != last:                 yield n                 last = n     result =  itertools.islice(num_recur(), n)     return list(result)[-1] n=int(input()) print(nth_hamming_number(n)) @Coding_000 virtusa neural hack code

#include <iostream> using namespace std; int main() { int n; cin>>n; cout<<int(n/10)<<endl;     return 0; } @Coding_000 Virtusa neural hack code