#AlgoExpert
#SortedSquaredArray
#include <algorithm>
#include <ranges>
#include <vector>

using std::vector;

// sorted squared array
static vector<int> sortedSqArr(vector<int> lst) {
int N = lst.size(), start = 0, end = lst.size() - 1, i; // setup pointers
vector<int> result(N);

i = end;
while (i >= 0) {
if (abs(lst[start]) <= abs(lst[end])) {
result[i] = lst[end] * lst[end];
end--;
}
else if (abs(lst[start]) > abs(lst[end])) {
result[i] = lst[start] * lst[start];
start++;
}
i--;
}
return result;
}


int main() {
vector<int> lst{ -7, -5, -4, 3, 6, 8, 9 };
auto result = sortedSqArr(lst);

return 0;
}