Leetcode 1299. Replace Elements with Greatest Element on Right Side

Replace each element in the array with the greatest element among those to its right (and set the last element to -1). This is typically solved by scanning from right to left while tracking the running maximum to get O(n) time and O(1) extra space.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1299. Replace Elements with Greatest Element on Right Side

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact