XOR bit manipulation – Embedded Prep

Swap Using XOR: 7 Powerful and Easy Techniques Explained for Beginners

Nov 17, 2025

—

by

in Bit Manipulation, Embedded, XOR bit manipulation

Swapping two variables is one of the fundamental operations in programming. Most developers learn the traditional method first — using a temporary variable. However, there is a more efficient and mathematically elegant technique: swap using XOR. This method allows you to exchange the values of two variables without using any extra memory, relying entirely on…

Find the Number That Appears Odd Number of Times | Master Beginner Friendly Tutorials (2026)

Aug 11, 2025

—

by

Raj Kumar

in Automotive Ethernet, bitwise operator tutorial, coding interview question, find number odd number of times, odd occurrence in array, XOR bit manipulation

Master the problem of finding the number that appears odd number of times in an array with this beginner-friendly guide. Learn step-by-step how the XOR operation works to solve this problem efficiently in O(n) time and O(1) space. Includes detailed explanations, example walkthroughs, and fully working code in C, C++, Java, and Python. Perfect for…

Minimum Bit Flips to Convert Number | Master Beginner’s Guide with LeetCode Solution 2026

Aug 11, 2025

—

by

Raj Kumar

in Bit Manipulation, Embedded, LeetCode Solutions, XOR bit manipulation

Minimum Bit Flips to Convert Number : When working with binary numbers in programming, you might encounter a problem where you need to find the minimum number of bit flips required to convert one number into another. This is a common interview and LeetCode problem that tests your understanding of bit manipulation. In this guide,…

Category: XOR bit manipulation

Swap Using XOR: 7 Powerful and Easy Techniques Explained for Beginners

Find the Number That Appears Odd Number of Times | Master Beginner Friendly Tutorials (2026)

Minimum Bit Flips to Convert Number | Master Beginner’s Guide with LeetCode Solution 2026