Salesforce all codes available

✔️ optimizeApiRegions

✔️ minRequestTime

✔️ Getassignedcluster

DM @Mrtrueliving_ix ✅

Only verfied codes are available ✔️

Deshaw Help available

DM @Mrtrueliving_ix ✅

Final call for PayU ....

Help available DM @Mrtrueliving_ix ✔️

Wipro 9 am all codes available

DM @Mrtrueliving_ix ✔️🎉

Wipro 12 pm codes are available

DM @Mrtrueliving_ix 💯✔️

Flipkart SDE Help available.....

DM @Mrtrueliving_ix 💯🎉

Previous helping proofs 💯

https://t.me/code_alphix/836

https://t.me/code_alphix/880

Gaint Egale Help done ✔️

Test accomplished 🪄

Pics sharing.....🎉💻

All placement help available

#Gaint_Egale #Offcampus

n = int(input())
a = list(map(int, input().split()))
k = int(input())

res = []
i = 0
while i < n and len(res) < k:
if a[i] < 0:
res.append(i + 1)
a[i] *= -1
if i + 1 < n:
a[i + 1] *= -1
i += 1

if any(x < 0 for x in a):
print(-1)
else:
print(' '.join(map(str, res)))

N application ✔️

Another approach ✔️