>RunTimeFix
BookStudyPracticeInterviewsYouTubeCoursesAbout
Log inGet Started
Practice/Combinatorics & Counting
4 subtopics · 15 problems

Combinatorics & Counting

Counting, permutations, combinations, inclusion-exclusion, and constructive algorithms.

01Counting & nCk

Combinations, Pascal's triangle, stars and bars.

2 medium2 hard
ProblemDifficultyLink
1862DIce Cream BallsmediumSolve
894BRalph And His Magic FieldmediumSolve
1900DSmall GCDhardSolve
1837EPlayoff FixinghardSolve

02Inclusion-Exclusion Principle

Count by adding and subtracting overlapping sets.

3 hard
ProblemDifficultyLink
451EDevu and FlowershardSolve
1295DSame GCDshardSolve
997CSky Full of StarshardSolve

03Constructive Algorithms

Build a valid answer rather than optimizing one.

1 easy3 medium1 hard
ProblemDifficultyLink
1921BArranging CatseasySolve
1829CMr. Perfectly FinemediumSolve
1360GA/BmediumSolve
1515CPhoenix and TowersmediumSolve
1904DSet To MaxhardSolve

04Pigeonhole Principle

If n+1 items go into n boxes, at least one box has ≥ 2 items.

2 medium1 hard
ProblemDifficultyLink
1516BAGAGA XOOORRRmediumSolve
1294CProduct of Three NumbersmediumSolve
735DTaxeshardSolve
All TopicsStudy the Theory
Was this helpful?
>RunTimeFix

Practical programming education. Books, videos, courses, and hands-on learning for competitive programming, DSA, and software engineering.

RunTimeFix

  • About
  • YouTube
  • Book
  • Study Library
  • Courses

Learn

  • Competitive Programming
  • DSA
  • Development
  • Databases

Legal

  • Privacy
  • Terms
  • Refund Policy

RunTimeFix — debug → solve → run

© 2026 RunTimeFix. All rights reserved.