
LeetCode 1299 – Replace Elements with Greatest on Right
Solved: Replace each element with the greatest on its right
Traversed from right to left, tracked max so far
O(n) time, O(1) space — clean in-place solution!
Nice reverse traversal practice
#LeetCode #PythonDSA #ArrayLogic
English








