₦airaland Forum

dominique:
Na dem o!!

Association of begging scammers on Nairaland, their headquarters is in Kogi state. These ones won't openly ask for help, what they'll do is post all sorts of sob stories hoping somebody will ask for their account details. I'm sure this is the same "girl" who is using virginity to blackmail people into helping "her". What's your next move now oga? Post with a bottle of sniper?

Zonefree:
I never knew this blessedmercy8 is same person as Mercychen, aka Channah.


Only one person chop swallow and yam porridge at a sitting Tomorrow now, they'll be complaining of protruded belly.

leksite120:
This is by far very worse.
Their exchange rate to naira is just a mirage and hoax.
The real economic power lies in the purchasing power.

ADAMUdaCOWBOY:
I don't get you. If industrialisation puts the blame on the consumer then they, being higher consumers should also be the ones to be blamed. They produce more, consume more, have a higher carbon footprint.

ADAMUdaCOWBOY:
Our consumption per capital is still low too.

shortIGBOman:
This Delta State woman is a blessing to Nigeria and Africa at large.

DamnnNiggarr:
This is really heart breaking,
Sometimes, it will look as if the gates of hell is let open upon Africa. We're here suffering what we know next to nothing about.

Ngozi Okonjo-Iweala
@NOIweala


https://twitter.com/NOIweala/status/1590053130544242694?t=Jy-1AddJ2gpCDWil6FZQbA&s=19[/quote]That's because we aren't industrialized. Not being industrialized doesn't absolve us from the blame as we still consume the end product of industrialization elsewhere. No need to play the victim card here.

sylve11:
I have never seen a big harvest from yams in the sack.
They are always tiny.

namikaze:
1. loop nesting does not affect space complexity by it self.
2. Time and space are measured differently, there is no "time or space", there's only "time and space"
3. O(1) for time differs from the O(1) for space.
4. The problem is solvable in O(n) time, not O(1).

FarmTech:
.
Hello. What are the possibilitlies of building a nuclear bomb from materials sourced from a nuclear power plant?

FreeStuffsNG:
The first one, bigger and more expensive one should be sited in Lagos because of the abundance of water in Lagos to cool the towers and Lagos is known for its excellent capability in managing public affairs, security and valuable, profitable use of public assets.

Electricity from it will serve the industries in Lagos and Ogun states.

The second one may be sited in Rivers State or Ondo to serve the Niger Delta and Abia

Najdorf:
We have explained this thing multiple times in different ways...

I'm even tired sef

namikaze:
Calm down, you're the only saying the question is pointless, it justs means you probably don't understand it yet.
Think of it as quicksort's partitioning algorithm, every item smaller than or equal to the pivot goes left of the pivot, greater than or equal goes to right.
for example;
piv = 5, arr = [2,5,1,4,7,3,6]
some valid solutions include:
1. [2,4,3,1,5,7,6].
2. [1,2,3,4,5,6,7].
note that 2 is just the array sorted.

The same goes for the question but with the new constraint that all items equal to the pivot stays at the middle, together with the pivot.
for example;
piv = 5, arr = [5,2,5,1,4,5,7,3,6]
some valid solutions include:
1. [2,4,3,1,5,5,5,7,6].
2. [1,2,3,4,5,5,5,6,7].
note that 2 is also just the array sorted.
sigh.

namikaze:
The three parts should be in the original list, i.e lower than x the first section, equal to x next and greater than x last.

dominique:
Tomatoes (thrives on any type of soil), peppers, okra, vegetables like ugu, shoko etc

namikaze:
The three parts should be in the original list, i.e lower than x the first section, equal to x next and greater than x last.

namikaze:
This problem was asked by Amazon.

Given a pivot x, and a list lst, partition the list into three parts.
* The first part contains all elements in lst that are less than x
* The second part contains all elements in lst that are equal to x
* The third part contains all elements in lst that are larger than x
Ordering within a part can be arbitrary.
For example, given x = 10 and lst = [9, 12, 3, 5, 14, 10, 10],
one partition may
be [9, 3, 5, 10, 10, 12, 14].

Can you solve it in strictly O(n) time and O(1) space complexity?
I'd like to see what you come up with.

namikaze:
given x = 10 and lst = [9, 12, 3, 5, 14, 10, 10],
sorting lst would yield: [3, 5, 9, 10, 10, 12, 14].
This satisfies the constraints, no need for further processing.

namikaze:
You did not get my point, "return sorted(arr)" is automatically a valid solution, no need to loop through anything.

namikaze:
Sorting the array only is a valid solution, only issue is the n log n runtime.

Najdorf:
Very concise solution sir

Unfortunately it doesn't satisfy the constraint of space complexity.

To make it understandable for any potential future readers, the space complexity for this problem must be constant->O(1). That means you can't create any auxiliary data structure that isn't of constant size.

In the case of your solution–as well as the other similar solutions posted earlier, you are creating new lists of length n, making the space complexity O(n) which doesn't meet the demands of the question.