Moving Negative Elements to the end of the array

How I Understood Moving Negative Elements to the End of an Array At first, this problem looked tricky because it asks us to move all negative numbers to the end while keeping the relative order of the other elements. But after breaking it down, I realized the idea is simple: separate positives and negatives, then combine them. Problem Given an array of integers, move all negative numbers to the end without changing the relative order of positive and negative numbers. Example: Python arr = [1, -1, 3, 2, -7, -5, 11, 6] Expected output: Python [1, 3, 2, 11, 6, -1, -7, -5] Notice that the relative order of positives and negatives remains the same. What I Noticed Instead of trying to swap elements in place and manage complicated pointer logic, I focused on a simpler idea: First, collect all non-negative numbers in order Then, collect all negative numbers in order Finally, copy them back to the original array This keeps the original order intact and is easy to implement. ** What Helped Me**