Swap two numbers using Bitwise XOR Operator
Objective– Given two numbers, swap both the numbers using XOR operators. Example: X = 4, Y = 8 Output: X = 8, Y= 4 Approach: XOR operator There are many ways to swap two...
Select level
Subscribe for New Posts ( No Spams!!)
Recent Posts
- Infix, Postfix and Prefix Notations/Expressions
- Count Set bits in a given Number
- Check if array contains all unique or distinct numbers.
- Product of all Unique elements in a given array.
- Valid Multiple Parentheses
- Reverse a given number – Java Code
- Check if given number is perfect square – O(√N) Solution
- Least Recently Used (LRU) Cache – Using HashMap and Doubly Linked List | Set 1
- Find first three largest elements in a given array
- Selection Sort – Java Implementation
Top Posts & Pages
- Reverse a Linked List
- Home - All Articles
- Dynamic Programming - Subset Sum Problem
- Backtracking - N Queens Problem
- Binary Search Tree Complete Implementation.
- Weighted Graph Implementation – JAVA
- Graph Representation - Adjacency Matrix and Adjacency List
- Dynamic Programming - Longest Common Substring
- Dynamic Programming - Coin Change Problem
- Graph Implementation – Adjacency List - Better| Set 2