# Count Good Triplets In An Array: Practice Notes

Count Good Triplets In An Array shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

nums1 and nums2 are permutations of 0..n-1. A triplet of values is good if the three appear in the same order in both arrays. Map values to their nums2 positions, then convert nums1 into that position sequence and count increasing triples i
## 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 n).

## Common mistake

Counting triples that are increasing in only one array, or doing O(n^3).

## 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 https://www.linkjob.ai/.