[BUG] - Documentation - Cheat sheet stack complexity is not correct

[tartur]

LeetCode Username

JyH8zLPKWZ

Problem Number, Title, and Link

Time complexity, Stack, https://leetcode.com/explore/interview/card/cheatsheets/720/resources/4725/

Bug Category

Editorial

Bug Description

The 'Access or modify element at arbitrary index' should be O(n) not O(1)

Language Used for Code

None

Code used for Submit/Run operation

Expected behavior

The 'Access or modify element at arbitrary index' should be O(n)

Screenshots

No response

Additional context

No response

[wktang]

oj-leetcode commented: Hello,

Your reported issue has been relayed to our team for thorough investigation. We appreciate your patience as we work to address and resolve this matter. We will reach out to you when we have updates regarding the issue.

If you have any further questions or concerns in the meantime, please feel free to let us know.

Best regards,
LeetCode Support Team

[wktang]

Epiphania_Ekenimoh commented: Hi there,

Thank you for taking the time to share your feedback with us.

After careful consideration, we have decided not to move forward with the changes suggested in your feedback. Although a stack typically does not allow direct access to elements by index, Since its written there that its implemented using a dynamic array (like Python’s list or C++’s vector), then random access is possible internally, and it runs in O(1) time.

This is because a dynamic array stores elements in contiguous memory, which means the position of any element can be calculated directly using its index. So when you do something like arr[i], the program can jump straight to that element in memory; no need to scan the array or iterate through it.
That’s why reading or modifying an element at any index in a dynamic array takes constant time, i.e., O(1).

Please know that your input is important to us. Your continued feedback is greatly appreciated as we work towards improving our platform.

Best regards,
LeetCode Support Team

[tartur]

Oh you are right sorry, for dynamic array implementation, but as it is a Cheat sheet, I expected it to be a very fast reminder on different operations complexities, so may be it should be indicated that for other implementations (linked list for instance) it is an O(n) but I agree your point of view!