add space complexity clarification

Author: neetcode-gh

articles/next-greater-element-i.md

@@ -229,6 +229,8 @@ impl Solution {
 - Time complexity: $O(m * n)$
 - Space complexity: $O(1)$
 
+> The output array is not counted towards space complexity, as the [standard convention](https://en.wikipedia.org/wiki/DSPACE) measures only auxiliary working space.
+
 > Where $m$ is the size of the array $nums1$ and $n$ is the size of the array $nums2$.
 
 ---

articles/replace-elements-with-greatest-element-on-right-side.md

@@ -184,6 +184,8 @@ impl Solution {
 - Time complexity: $O(n ^ 2)$
 - Space complexity: $O(1)$
 
+> The output array is not counted towards space complexity, as the [standard convention](https://en.wikipedia.org/wiki/DSPACE) measures only auxiliary working space.
+
 ---
 
 ## 2. Suffix Max
@@ -347,6 +349,8 @@ impl Solution {
 - Time complexity: $O(n)$
 - Space complexity: $O(1)$
 
+> The output array is not counted towards space complexity, as the [standard convention](https://en.wikipedia.org/wiki/DSPACE) measures only auxiliary working space.
+
 ---
 
 ## Common Pitfalls

articles/successful-pairs-of-spells-and-potions.md

@@ -213,6 +213,8 @@ impl Solution {
 - Time complexity: $O(n * m)$
 - Space complexity: $O(1)$
 
+> The output array is not counted towards space complexity, as the [standard convention](https://en.wikipedia.org/wiki/DSPACE) measures only auxiliary working space.
+
 > Where $n$ and $m$ are the sizes of the arrays $spells$ and $potions$ respectively.
 
 ---