Successfully placed in Capgemini 🎉🔸
Role : Analyst
Package: 4Lpa + 25k joining Bonus
Preview Proofs ✅💯
Aptitude
https://t.me/code_alphix/6085?single
Coding
https://t.me/code_alphix/6128?single
DM @Mrtrueliving_ix✔️🎉✅
#Capgemini #Placed #HiringVision💯
Heartly congratulations 🎉✅🎉
#Stay tuned @code_alphix
Share with your friends too
#Helpthemtosucceed @Mrtrueliving_ix
Role : Analyst
Package: 4Lpa + 25k joining Bonus
Preview Proofs ✅💯
Aptitude
https://t.me/code_alphix/6085?single
Coding
https://t.me/code_alphix/6128?single
All placement help available
DM @Mrtrueliving_ix✔️🎉✅
#Capgemini #Placed #HiringVision💯
Heartly congratulations 🎉✅🎉
All Exams Help available
#Stay tuned @code_alphix
Share with your friends too
#Helpthemtosucceed @Mrtrueliving_ix
Your success is our mission 😍
❤2👌1🫡1
All placement help available
DM FOR OA help
@Mrtrueliving_ix @Mrtrueliving_ix
Test Clearance 💯 & High success rate 🤞
DM FOR OA help
@Mrtrueliving_ix @Mrtrueliving_ix
Test Clearance 💯 & High success rate 🤞
Amazon SDE Help done ✅
Test accomplished ❤️
DM @Mrtrueliving_ix for test clearance 💯
#Amazon #SDE #Offcampus
Test accomplished ❤️
DM @Mrtrueliving_ix for test clearance 💯
#Amazon #SDE #Offcampus
Myntra Help available
Batch : 2026 only
Test date nd time: 7th & 4 pm - 11 pm
DM @Mrtrueliving_ix for test clearance 💯
Apply now ✅
https://t.me/code_alphix/6481
Previous helping proofs
https://t.me/code_alphix/4119?single
Batch : 2026 only
Test date nd time: 7th & 4 pm - 11 pm
DM @Mrtrueliving_ix for test clearance 💯
Apply now ✅
https://t.me/code_alphix/6481
Previous helping proofs
https://t.me/code_alphix/4119?single
🏆1
Turing // python - 💯 test mail 📬
https://cuvette.tech/app/other-jobs/681918e18c4f50f5eb58a0f7?referralCode=GEA52O
Google // web solutions
https://cuvette.tech/app/other-jobs/681914d2da26d41e74cf52c9?referralCode=GEA52O
Amadeus
https://cuvette.tech/app/other-jobs/681913ed2ecc2f2513872839?referralCode=GEA52O
Sprinkler
https://cuvette.tech/app/other-jobs/681525380f9e583859197b25?referralCode=GEA52O
American express
https://cuvette.tech/app/other-jobs/68191a0f3687a0f14f08ef6d?referralCode=GEA52O
Don't miss the opportunity 🤗 🤞
https://cuvette.tech/app/other-jobs/681918e18c4f50f5eb58a0f7?referralCode=GEA52O
Google // web solutions
https://cuvette.tech/app/other-jobs/681914d2da26d41e74cf52c9?referralCode=GEA52O
Amadeus
https://cuvette.tech/app/other-jobs/681913ed2ecc2f2513872839?referralCode=GEA52O
Sprinkler
https://cuvette.tech/app/other-jobs/681525380f9e583859197b25?referralCode=GEA52O
American express
https://cuvette.tech/app/other-jobs/68191a0f3687a0f14f08ef6d?referralCode=GEA52O
Don't miss the opportunity 🤗 🤞
Sending test mails confirm ✅
All placement help available
- Myntra - 2026 batch
- Amazon SDE
- IBM all roles
- mykaarma
- Rupeek
- Cognizant // aptitude
- Wipro Elite
- Wipro Milestone
- turing
Any on // off campus placement
DM @Mrtrueliving_ix for test clearance
Test clearance 💯 & high success rate ❤️
Scroll down check previous helping proofs & placement offers
- Myntra - 2026 batch
- Amazon SDE
- IBM all roles
- mykaarma
- Rupeek
- Cognizant // aptitude
- Wipro Elite
- Wipro Milestone
- turing
Any on // off campus placement
DM @Mrtrueliving_ix for test clearance
Test clearance 💯 & high success rate ❤️
Scroll down check previous helping proofs & placement offers
Myntra Help available
Batch : 2026 only
Test timings 4 pm - 11.59 pm
DM @Mrtrueliving_ix for test clearance 💯
https://t.me/code_alphix/4119?single
Batch : 2026 only
Test timings 4 pm - 11.59 pm
DM @Mrtrueliving_ix for test clearance 💯
Previous helping proofs
https://t.me/code_alphix/4119?single
Cognizant 8th Aptitude Help available
- All Slots are available
DM @Mrtrueliving_ix for test clearance
Recent proofs & scroll down
https://t.me/code_alphix/6437
Those who need 💯 test Clearance ❤️
- All Slots are available
DM @Mrtrueliving_ix for test clearance
Recent proofs & scroll down
https://t.me/code_alphix/6437
Those who need 💯 test Clearance ❤️
import sys
from itertools import permutations
def is_fancy(seq):
n = len(seq)
for i in range(1, n):
if i % 2 == 1:
if seq[i] <= seq[i - 1]:
return False
else:
if seq[i] >= seq[i - 1]:
return False
for i in range(1, n, 2):
if i + 2 < n and seq[i] >= seq[i + 2]:
return False
return True
def main():
n = int(sys.stdin.readline())
a = list(map(int, sys.stdin.readline().split()))
count = 0
for p in set(permutations(a)):
if is_fancy(p):
count += 1
print(count % 998244353)
main()
from itertools import permutations
def is_fancy(seq):
n = len(seq)
for i in range(1, n):
if i % 2 == 1:
if seq[i] <= seq[i - 1]:
return False
else:
if seq[i] >= seq[i - 1]:
return False
for i in range(1, n, 2):
if i + 2 < n and seq[i] >= seq[i + 2]:
return False
return True
def main():
n = int(sys.stdin.readline())
a = list(map(int, sys.stdin.readline().split()))
count = 0
for p in set(permutations(a)):
if is_fancy(p):
count += 1
print(count % 998244353)
main()
❤1
import sys
grid = [list(input().strip()) for _ in range(4)]
def is_valid(r, c, ch):
for i in range(4):
if grid[r][i] == ch or grid[i][c] == ch:
return False
sr, sc = (r // 2) * 2, (c // 2) * 2
for i in range(sr, sr + 2):
for j in range(sc, sc + 2):
if grid[i][j] == ch:
return False
return True
def solve(pos=0):
if pos == 16:
return True
r, c = divmod(pos, 4)
if grid[r][c] != '*':
return solve(pos + 1)
for ch in 'ABCD':
if is_valid(r, c, ch):
grid[r][c] = ch
if solve(pos + 1):
return True
grid[r][c] = '*'
return False
if solve():
for row in grid:
print(''.join(row))
else:
print(-1)
def dv(n):
r = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
r.append(i)
if i != n // i:
r.append(n // i)
return r
def pts(n, a):
dvs = dv(n)
ans = 0
for k in dvs:
if k == 1:
continue
gs = [a[i:i+k] for i in range(0, n, k)]
for d in range(2, max(a)+1):
rems = [tuple(x % d for x in g) for g in gs]
if all(r == rems[0] for r in rems):
ans += 1
break
return ans
n = int(input())
a = list(map(int, input().split()))
print(pts(n, a))
r = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
r.append(i)
if i != n // i:
r.append(n // i)
return r
def pts(n, a):
dvs = dv(n)
ans = 0
for k in dvs:
if k == 1:
continue
gs = [a[i:i+k] for i in range(0, n, k)]
for d in range(2, max(a)+1):
rems = [tuple(x % d for x in g) for g in gs]
if all(r == rems[0] for r in rems):
ans += 1
break
return ans
n = int(input())
a = list(map(int, input().split()))
print(pts(n, a))
Cognizant 8th Aptitude Help available
- All Slots are available
DM @Mrtrueliving_ix for test clearance
Recent proofs & scroll down
https://t.me/code_alphix/6437
Those who need 💯 test Clearance ❤️
- All Slots are available
DM @Mrtrueliving_ix for test clearance
Recent proofs & scroll down
https://t.me/code_alphix/6437
Those who need 💯 test Clearance ❤️
Final reminder 🎗️
Cognizant Genc Interview experience 7th May 2025
1. Self introduction
2. Final year project
3. Directly asking write a code to add 2 numbers
4. Choose 1 language either python or Java write a code and execute
5. Python libraries and deep explanation
6. List and tuple
7. fibonacci series explanation and he asked to write a code
8. Linked list from DSA
9. Trees and graphs deep explanation
10. Sql tables and queries
11. All joints explanation with real time examples
12. Are you ready to relocate
13. Are you ready to work on any technology
14. Are you ready to work on coimbatore or Chennai
15. Finally do you have any questions ❓👍1