>RunTimeFix
BookStudyPracticeInterviewsYouTubeCoursesAbout
Log inGet Started
Topics/Bit Manipulation
intermediate level

Bit Manipulation

Quick Answer

What is Bit Manipulation?

Bit manipulation is the art of using bitwise operators to solve problems efficiently. Many contest problems have elegant solutions using XOR properties, bitmask enumeration, or subset iteration that would be exponentially slower with naive approaches. RunTimeFix covers the essential bit tricks: checking/setting/clearing individual bits, XOR's cancellation property, iterating over all subsets of a bitmask, and the __builtin functions (popcount, clz, ctz). Bitmask DP — combining dynamic programming with bitmask state representation — is covered in detail.

  • bit manipulation
  • bitwise operators
  • XOR
  • bitmask
  • bitmask DP
  • bit tricks

Study Material for Bit Manipulation

Ch 17: Bit Manipulation & Masking

Bitwise Operators · Bit Tricks · XOR Properties · Bitmask Enumeration · __builtin Functions

Ch 27: Dynamic Programming — Knapsack & Subsets

The 0-1 Knapsack Problem · Unbounded Knapsack · Subset Sum & Knapsack Variants · Bitmask DP

Related Topics

Dynamic ProgrammingAlgorithmsC++ for Competitive Programming
Was this helpful?

Published by RunTimeFix · Comprehensive guides for competitive programming

>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.