100% Free Forever
AI-Powered Learning
Industry Expert Content
Certificates & Badges
Learn At Your Own Pace

How to Solve Circular Permutation Problems

Solve circular permutation aptitude problems — (n−1)! rule, necklace halving, sit-together conditions — with worked examples and practice.

hardQ168 of 225 in Aptitude Est. time: 6 minsLast updated:
Open Code Lab

Expected Interview Answer

Arranging n distinct people around a circle gives (n−1)! arrangements rather than n!, because rotating everyone by one seat produces the same relative arrangement, so all n rotations of a linear arrangement are counted as a single circular one; if clockwise and counter-clockwise arrangements are also considered identical (as with a necklace), the count halves further to (n−1)!/2.

A linear arrangement of n items has n! orderings, but on a circle there is no fixed “first” seat, so fixing one person’s position removes the redundant rotations and leaves (n−1)! ways to arrange the rest relative to them. When the arrangement can be flipped over (a necklace or bracelet, viewed from either side), clockwise and counter-clockwise versions that are mirror images of each other are also considered the same, dividing the count by 2 to give (n−1)!/2. Restrictions like “two specific people must sit together” are handled by first gluing them into a single block, arranging (n−1) units in a circle — (n−2)! ways — then multiplying by 2 for the block’s internal order. "Must NOT sit together" uses the complement: total circular arrangements minus the together-arrangements.

  • One fix — anchor one seat — converts the circular case cleanly from n! to (n−1)!
  • The necklace/bracelet halving rule is a simple, memorable extension
  • "Sit together" and “must not sit together” reduce to block-gluing and complement tricks

AI Mentor Explanation

Seating 8 players around a circular team dinner table has (8−1)! = 5040 distinct arrangements, not 8!, because rotating every player one seat to the left produces a table that looks identical in terms of who sits next to whom. Fixing the captain’s seat as a reference point removes this redundancy, leaving the other 7 players to be arranged relative to the captain in 7! ways. If two teammates insist on sitting together, glue them into one unit, arrange 7 units circularly — 6! ways — then multiply by 2 for their internal left-right order.

Worked example (with two people together)

Step-by-Step Explanation

  1. Step 1

    Anchor one position

    Fix one person’s seat to remove rotational duplicates: use (n−1)! instead of n!.

  2. Step 2

    Check for reflection symmetry

    If clockwise and counter-clockwise are equivalent (necklace), divide by 2: (n−1)!/2.

  3. Step 3

    Handle “must sit together”

    Glue the pair into one block, circularly arrange (n−1) units, multiply by 2 for the block’s internal order.

  4. Step 4

    Handle “must not sit together”

    Subtract the together-count from the total unrestricted circular arrangements.

What Interviewer Expects

  • Correctly applying (n−1)! instead of n! for circular arrangements
  • Recognizing when to halve for reflection symmetry (necklace/bracelet cases)
  • Correctly gluing adjacent-required people into a block and doubling for internal order
  • Correctly applying the complement for “must not sit together” conditions

Common Mistakes

  • Using n! instead of (n−1)! for a circular arrangement
  • Forgetting to halve for necklace/bracelet problems with reflection symmetry
  • Forgetting to multiply by 2 for the internal order of a glued “together” pair
  • Incorrectly subtracting for “must not sit together” without first computing the together-case correctly

Best Answer (HR Friendly)

On a circle there is no fixed starting seat, so rotating everyone by one position gives the same arrangement — that is why we use (n−1)! instead of n!, fixing one person’s seat as a reference point. If the object can also be flipped, like a necklace, clockwise and counter-clockwise versions match too, so we divide by 2 again. For “must sit together” conditions, glue the pair into one unit, arrange the smaller circle, then multiply by 2 for the pair’s internal order; for “must not sit together,” just subtract the together-count from the total.

Follow-up Questions

  • How would the formula change if the table had a distinguishable “head” seat?
  • How do you solve a circular arrangement where three specific people must sit together?
  • Why does a necklace arrangement divide by 2 but a round table with distinct fixed seats does not?
  • How would you count circular arrangements with some repeated identical items?

MCQ Practice

1. In how many ways can 6 distinct people be seated around a circular table?

(6−1)! = 5! = 120, since one rotation is fixed as reference.

2. In how many ways can 5 distinct beads be arranged on a necklace (clockwise = counter-clockwise)?

(5−1)!/2 = 24/2 = 12, halving for reflection symmetry.

3. 7 people sit around a circular table. Two specific people must sit together. How many arrangements?

Glue the pair: 6 units circularly = (6−1)! = 120, times 2 for internal order = 240.

Flash Cards

Formula for circular arrangement of n distinct people?(n−1)! — fixing one seat removes rotational duplicates.

Formula for a necklace/bracelet arrangement?(n−1)!/2 — also divides out mirror-image duplicates.

How to handle “must sit together” circularly?Glue into one block, arrange (n−1) units circularly, multiply by 2.

How to handle “must NOT sit together” circularly?Total circular arrangements minus the together-arrangements.

1 / 4

Continue Learning