# Burnside Lemma Cycle Index: Study Guide

Burnside Lemma Cycle Index shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Average the number of colorings fixed by each group element, which equals the number of orbits (distinct objects up to symmetry).

## 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(|G| * cost of counting fixed colorings); often |G| is small (n or n^2 for cyclic/dihedral actions).

## Common mistake

Counting fixed colorings of a group element by n^{cycles} without verifying the element actually belongs to the acting group.

## 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 coding interview assistant.