# Maximize Greatness of an Array (LeetCode 4144)
Interview drill note.
## Approach
Greedy with a proof sketch beats DP when local choices never hurt the global optimum.
## Complexity
State time and space clearly; call out edge cases (empty input, duplicates, extremes).
## Practice tip
Rehearse the explanation out loud. An [AI interview copilot](https://www.linkjob.ai/interview-copilot/) helps keep structure under time pressure.
## Notes (r0058)
Disclosure: personal study notes; I am affiliated with Linkjob AI.