← All problemsSign in

3576. Transform Array to All Equal Elements

LeetCodeArrayGreedyOpen on judge ↗

You are given an integer array nums of size n containing only 1 and -1, and an integer k. You can perform the following operation at most k times: - Choose an index i (0 <= i < n - 1), and multiply both nums[i] and nums[i + 1] by -1. Note that you can choose the same index i more than once in different operations. Return true if it is possible to make all elements of the array equal after at

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start