# Check If It Is A Good Array: Walkthrough

Check If It Is A Good Array shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

A subset of nums has gcd 1 iff the gcd of the whole array is 1 (Bézout). Compute gcd of all numbers and test equality to 1.

## 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 log A).

## Common mistake

Looking for a pair that already equals 1, or requiring the subset to be a pair rather than any size.

## 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 Linkjob AI.