tensazangetsu20:
You can solve this using quick sort.

tensazangetsu20:
You can solve this using quick sort.

function QuickSort(Arr, x){
if(Arr.length <= 1){
return Arr;
}

const pivot = x
const leftArr = [];
const rightArr = [];

for(let i=0; i < Arr.length-1;i++){
Arr[i] < pivot ? leftArr.push(Arr[i]) : rightArr.push(Arr[i])
}

return [...QuickSort(leftArr, leftArr[leftArr.length-1]) ,pivot,...QuickSort(rightArr, rightArr[rightArr.length -1])];

}

console.log(QuickSort([9, 12, 3, 5, 14, 10, 10], 10))

Luckydonalds:

Quick sort does not satisfy OP's constraint, it has O(N) space complexity and O(nlogn) time complexity for its best case. In it's worst case, it can have an O(n**2) complexity

namikaze:
Since constant space is required, no additional data structure's allowed.
I was able to come up with a solution by modifying the quicksort's partitioning algorithm, so that's a hint.

Luckydonalds:

Do you mean the we should modify the array passed to the function directly?

GREATIGBOMAN:
Can't believe Amazon ask such questions

salvationproject:
May not be the most efficient way of doing this in JS but it is very much effective.


function partitionArray(array, x)
{
let lArray = [], eArray = [], gArray = [];
for (let i = 0; i < array.length; i++)
{
let v = array[i];
if (v < x)
{
lArray.push(v);
}
else if (v == x)
{
eArray.push(v);
}
else
{
gArray.push(v);
}
}
return lArray.concat(eArray).concat(gArray);
}

alert(partitionArray([9, 12, 3, 5, 14, 10, 10], 10));

salvationproject:
May not be the most efficient way of doing this in JS but it is very much effective.


function partitionArray(array, x)
{
let lArray = [], eArray = [], gArray = [];
for (let i = 0; i < array.length; i++)
{
let v = array[i];
if (v < x)
{
lArray.push(v);
}
else if (v == x)
{
eArray.push(v);
}
else
{
gArray.push(v);
}
}
return lArray.concat(eArray).concat(gArray);
}

alert(partitionArray([9, 12, 3, 5, 14, 10, 10], 10));

bushjeph:
What sort of question be this?

namikaze:
The type that Amazon asks , too hard?

bushjeph:
what branch of subject i mean?

bushjeph:
what branch of subject i mean?

LikeAking:
Childs play....

Very useless question...


The question is very simple and straight forward Op sef no try, wetin be lst? Spell am well na @ list....

Let me break down this simple question...

You are given x assigned with a value of 10 and an array filled with lots of numbers '[9, 12, 3, 5, 14, 10, 10]'

Iterate through the array, find numbers less than x: = [

Iterate through the array, find numbers above than x.

Iterate through the array, find numbers equal than x.

Najdorf:

This is why you're not working at Amazon sir

LikeAking:


This is a baby question...

I don pass this level.

Every thin na chance, if I get an Interview with Amazon , I will nail it...


@ Najdorf, e b like u just dey start?

LikeAking:


This is a baby question...

I don pass this level.

Every thin na chance, if I get an Interview with Amazon , I will nail it...


@ Najdorf, e b like u just dey start?

Najdorf:

This is why you're not working at Amazon sir

GREATIGBOMAN:



U just display your stupidity in HD


U don't even understand the actual thing they're looking for in the question.


I bet you don't even know what O(1) or O(n) means

GREATIGBOMAN:



The way he post the nonsense boldly.
I wonder if he didn't see the solutions above which works but doesn't satisfy the questions Lol

Najdorf:

This is why you're not working at Amazon sir

Enceladus:
two pointers solves this in O(n) at worst. This is probable the first question to wet your appetite. It's suspiciously easy.

tensazangetsu20:
You can solve this using quick sort.

function QuickSort(Arr, x){
if(Arr.length <= 1){
return Arr;
}

const pivot = x
const leftArr = [];
const rightArr = [];

for(let i=0; i < Arr.length-1;i++){
Arr[i] < pivot ? leftArr.push(Arr[i]) : rightArr.push(Arr[i])
}

return [...QuickSort(leftArr, leftArr[leftArr.length-1]) ,pivot,...QuickSort(rightArr, rightArr[rightArr.length -1])];

}

console.log(QuickSort([9, 12, 3, 5, 14, 10, 10], 10))

TastyFriedPussy:
your own Na to rush into any coding challenge sharp sharp to go and solve rubbish, I've never seen any coding problem you solved on nairaland that is correct, never!!!!