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
Recent Posts
- Check if Given Number is power of 2.
- Rotate the given array in cycles
- Heap Sort – Java Implementation
- Print First n numbers in Fibonacci Series
- Find the Area and Perimeter of Rectangle – Java Program
- Find no of reverse pairs in an array which is sorted in two parts in O(N)
- Reverse the given String using Stack
- Stack Data Structure – Introduction and Implementation
- Dijkstra’s – Shortest Path Algorithm (SPT) – Adjacency List and Priority Queue – Java Implementation
- Bubble Sort and Optimized Bubble Sort- Java Implementation
Top Posts & Pages
- Reverse a Linked List
- Home - All Articles
- Dynamic Programming - Coin Change Problem
- Binary Search Tree Complete Implementation.
- Backtracking - N Queens Problem
- Dynamic Programming - Subset Sum Problem
- Dynamic Programming - Maximum Subarray Problem
- Search the Element in a binary tree - With and Without Recursion
- Binary Min - Max Heap
- Introduction To Dynamic Programming - Fibonacci Series