Even & Odd Using Bit Manipulation | LeetCode Problem | Lecture 2

🔥 **Bit Manipulation Lecture 2 – Even & Odd (LeetCode Problem)** In this video, we solve a **LeetCode problem** to check whether a number is **Even or Odd using Bit Manipulation**. This is one of the most important tricks for **DSA, Coding Interviews, and Competitive Programming**. 💡 Instead of using `% 2`, we use a faster **bitwise trick (n & 1)**: * Even → n & 1 = 0 * Odd → n & 1 = 1 --- 📌 **Topics Covered:** * What is Bit Manipulation * Even & Odd using Bitwise AND (&) * How (n & 1) works internally * Time Complexity Optimization * Java Code Implementation --- 💻 **Code (Java):** ```java public class EvenOdd { public static void main(String[] args) { int n = 7; if ((n & 1) == 0) { System.out.println("Even"); } else { System.out.println("Odd"); } } } ``` --- 🚀 **Why this is important?** Bit manipulation is widely used in: * LeetCode Problems * FAANG Interviews * Competitive Programming --- 📚 **Playlist (Bit Manipulation Series):** Lecture 1 → Introduction Lecture 2 → Even & Odd (This Video) --- 👍 Like, Share & Subscribe for more DSA content! 🔔 **Channel:** Code with Rahul Kumawat --- #BitManipulation #LeetCode #DSA #CodingInterview #Java #EvenOdd #Programming