اکنون در دسترس! پژوهش تلگرام ۲۰۲۵ — مهمترین بینشهای سال 
7 697
مشترکین
-324 ساعت
-77 روز
+4230 روز
آرشیو پست ها
ACCENTURE PRE-ONBAORDING EXAM✅✅
.NET✅
Contact : @MLCODER2
Accenture pre-joining slots Available✅
Contact : @IWANTCODE
📩 Need Help with Assessments & Coding Exams?
Struggling with aptitude questions or coding rounds? 🤔
I’ve got you covered 💻🔥
👉 Get help with:
✔️ Aptitude Questions
✔️ Coding Problems
✔️ Online Assessments
✔️ Placement Preparation
📬 Contact : @iwantcode
🚀 Don’t wait till last moment — start preparing smart!
ACCENTURE ON-CAMPUS SLOTS AVAILABLE✅✅
Contact : @MLCODER2
IBM-ISDL SLOTS AVAILABLE ✅
Contact : @MLCODER2
Note : Remote access available ☑️
def getKthMaximumORSum(arr, k):
from collections import Counter
n = len(arr)
count_map = Counter()
current_ors = Counter()
for x in arr:
new_ors = Counter()
for val, count in current_ors.items():
new_ors[val | x] += count
new_ors[x] += 1
for val, count in new_ors.items():
count_map[val] += count
current_ors = new_ors
sorted_sums = sorted(count_map.keys(), reverse=True)
for val in sorted_sums:
count = count_map[val]
if k <= count:
return val
k -= count
return -1
getKthMaximumORSum✅✅
def getClusterSizes(signature):
n = len(signature)
dsu = DSU(n)
prime_to_zone = {}
for i, sig in enumerate(signature):
temp = sig
d = 2
while d * d <= temp:
if temp % d == 0:
if d in prime_to_zone:
dsu.union(i, prime_to_zone[d])
else:
prime_to_zone[d] = i
while temp % d == 0:
temp //= d
d += 1
if temp > 1:
if temp in prime_to_zone:
dsu.union(i, prime_to_zone[temp])
else:
prime_to_zone[temp] = i
root_to_size = {}
for i in range(n):
root = dsu.find(i)
root_to_size[root] = root_to_size.get(root, 0) + 1
return [root_to_size[dsu.find(i)] for i in range(n)]
getClusterSizes✅
