# Minimum Deletions To Make Array Beautiful: Study Guide

Minimum Deletions To Make Array Beautiful shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

A beautiful array has even length and nums[i] != nums[i+1] on every even i. Scan even positions; if a pair matches, delete one element (shift the pairing) and count the deletion. If the final length is odd, delete the last element too.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n).

## Common mistake

Deleting both copies of a matching pair when one deletion is enough.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at AI interview copilot.