LeetCode #3819 — MEDIUM

Rotate Non Negative Elements

Move from brute-force thinking to an efficient approach using array strategy.

The Problem

Problem Statement

You are given an integer array nums and an integer k.

Rotate only the non-negative elements of the array to the left by k positions, in a cyclic manner.

All negative elements must stay in their original positions and must not move.

After rotation, place the non-negative elements back into the array in the new order, filling only the positions that originally contained non-negative values and skipping all negative positions.

Return the resulting array.

Example 1:

Input: nums = [1,-2,3,-4], k = 3

Output: [3,-2,1,-4]

Explanation:

The non-negative elements, in order, are [1, 3].
Left rotation with k = 3 results in:
- [1, 3] -> [3, 1] -> [1, 3] -> [3, 1]
Placing them back into the non-negative indices results in [3, -2, 1, -4].

Example 2:

Input: nums = [-3,-2,7], k = 1

Output: [-3,-2,7]

Explanation:

The non-negative elements, in order, are [7].
Left rotation with k = 1 results in [7].
Placing them back into the non-negative indices results in [-3, -2, 7].

Example 3:

Input: nums = [5,4,-9,6], k = 2

Output: [6,5,-9,4]

Explanation:

The non-negative elements, in order, are [5, 4, 6].
Left rotation with k = 2 results in [6, 5, 4].
Placing them back into the non-negative indices results in [6, 5, -9, 4].

Constraints:

1 <= nums.length <= 10⁵
-10⁵ <= nums[i] <= 10⁵
0 <= k <= 10⁵

Step 01

Brute Force Baseline

Problem summary: You are given an integer array nums and an integer k. Rotate only the non-negative elements of the array to the left by k positions, in a cyclic manner. All negative elements must stay in their original positions and must not move. After rotation, place the non-negative elements back into the array in the new order, filling only the positions that originally contained non-negative values and skipping all negative positions. Return the resulting array.

Baseline thinking

Start with the most direct exhaustive search. That gives a correctness anchor before optimizing.

Pattern signal: Array

Example 1

[1,-2,3,-4]
3

Example 2

[-3,-2,7]
1

Example 3

[5,4,-9,6]
2

Step 02

Core Insight

What unlocks the optimal approach

Pull out non-negative values and their indices.
Left-rotate the values by <code>k</code> (use <code>k %= m</code> where <code>m</code> is their count).
Put the rotated values back into the stored indices; leave negatives as-is and return the array.

Interview move: turn each hint into an invariant you can check after every iteration/recursion step.

Step 03

Algorithm Walkthrough

Iteration Checklist

Define state (indices, window, stack, map, DP cell, or recursion frame).
Apply one transition step and update the invariant.
Record answer candidate when condition is met.
Continue until all input is consumed.

Use the first example testcase as your mental trace to verify each transition.

Step 04

Edge Cases

Minimum Input

Single element / shortest valid input

Validate boundary behavior before entering the main loop or recursion.

Duplicates & Repeats

Repeated values / repeated states

Decide whether duplicates should be merged, skipped, or counted explicitly.

Extreme Constraints

Upper-end input sizes

Re-check complexity target against constraints to avoid time-limit issues.

Invalid / Corner Shape

Empty collections, zeros, or disconnected structures

Handle special-case structure before the core algorithm path.

Step 05

Full Annotated Code

Source-backed implementations are provided below for direct study and interview prep.

// Accepted solution for LeetCode #3819: Rotate Non Negative Elements
class Solution {
    public int[] rotateElements(int[] nums, int k) {
        int m = 0;
        for (int x : nums) {
            if (x >= 0) {
                m++;
            }
        }
        int[] t = new int[m];
        int p = 0;
        for (int x : nums) {
            if (x >= 0) {
                t[p++] = x;
            }
        }
        int[] d = new int[m];
        for (int i = 0; i < m; i++) {
            d[((i - k) % m + m) % m] = t[i];
        }
        int j = 0;
        for (int i = 0; i < nums.length; i++) {
            if (nums[i] >= 0) {
                nums[i] = d[j++];
            }
        }
        return nums;
    }
}

// Accepted solution for LeetCode #3819: Rotate Non Negative Elements
func rotateElements(nums []int, k int) []int {
	t := make([]int, 0)
	for _, x := range nums {
		if x >= 0 {
			t = append(t, x)
		}
	}
	m := len(t)
	d := make([]int, m)
	for i, x := range t {
		d[((i-k)%m+m)%m] = x
	}
	j := 0
	for i, x := range nums {
		if x >= 0 {
			nums[i] = d[j]
			j++
		}
	}
	return nums
}

# Accepted solution for LeetCode #3819: Rotate Non Negative Elements
class Solution:
    def rotateElements(self, nums: List[int], k: int) -> List[int]:
        t = [x for x in nums if x >= 0]
        m = len(t)
        d = [0] * m
        for i, x in enumerate(t):
            d[((i - k) % m + m) % m] = x
        j = 0
        for i, x in enumerate(nums):
            if x >= 0:
                nums[i] = d[j]
                j += 1
        return nums

// Accepted solution for LeetCode #3819: Rotate Non Negative Elements
// Rust example auto-generated from java reference.
// Replace the signature and local types with the exact LeetCode harness for this problem.
impl Solution {
    pub fn rust_example() {
        // Port the logic from the reference block below.
    }
}

// Reference (java):
// // Accepted solution for LeetCode #3819: Rotate Non Negative Elements
// class Solution {
//     public int[] rotateElements(int[] nums, int k) {
//         int m = 0;
//         for (int x : nums) {
//             if (x >= 0) {
//                 m++;
//             }
//         }
//         int[] t = new int[m];
//         int p = 0;
//         for (int x : nums) {
//             if (x >= 0) {
//                 t[p++] = x;
//             }
//         }
//         int[] d = new int[m];
//         for (int i = 0; i < m; i++) {
//             d[((i - k) % m + m) % m] = t[i];
//         }
//         int j = 0;
//         for (int i = 0; i < nums.length; i++) {
//             if (nums[i] >= 0) {
//                 nums[i] = d[j++];
//             }
//         }
//         return nums;
//     }
// }

// Accepted solution for LeetCode #3819: Rotate Non Negative Elements
function rotateElements(nums: number[], k: number): number[] {
    const t: number[] = nums.filter(x => x >= 0);
    const m = t.length;
    const d = new Array<number>(m);
    for (let i = 0; i < m; i++) {
        d[(((i - k) % m) + m) % m] = t[i];
    }
    let j = 0;
    for (let i = 0; i < nums.length; i++) {
        if (nums[i] >= 0) {
            nums[i] = d[j++];
        }
    }
    return nums;
}

Step 06

Interactive Study Demo

Use this to step through a reusable interview workflow for this problem.

Custom checkpoints (one per line)

Press Step or Run All to begin.

Step 07

Complexity Analysis

Time

O(n)

Space

O(1)

Approach Breakdown

BRUTE FORCE

O(n²) time

O(1) space

Two nested loops check every pair or subarray. The outer loop fixes a starting point, the inner loop extends or searches. For n elements this gives up to n²/2 operations. No extra space, but the quadratic time is prohibitive for large inputs.

OPTIMIZED

O(n) time

O(1) space

Most array problems have an O(n²) brute force (nested loops) and an O(n) optimal (single pass with clever state tracking). The key is identifying what information to maintain as you scan: a running max, a prefix sum, a hash map of seen values, or two pointers.

Shortcut: If you are using nested loops on an array, there is almost always an O(n) solution. Look for the right auxiliary state.

Coach Notes

Common Mistakes

Review these before coding to avoid predictable interview regressions.

Off-by-one on range boundaries

Wrong move: Loop endpoints miss first/last candidate.

Usually fails on: Fails on minimal arrays and exact-boundary answers.

Fix: Re-derive loops from inclusive/exclusive ranges before coding.