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
- Max Flow Problem – Ford-Fulkerson Algorithm
- Sum of all Unique elements in a given array
- Java program to find the largest element in array
- Convert Infix to Postfix Expression
- Find three smallest elements in a given array
- Evaluation of Infix expressions
- Stack Java Class – Explained
- Least Recently Used (LRU) Cache – Using LinkedHashSet and Deque | Set 2
- Merge K sorted Linked List – Using Priority Queue
- Infix, Postfix and Prefix Notations/Expressions
Top Posts & Pages
- Home - All Articles
- Binary Search Tree Complete Implementation.
- Weighted Graph Implementation – JAVA
- Kruskal's Algorithm – Minimum Spanning Tree (MST) - Complete Java Implementation
- Graph – Detect Cycle in a Directed Graph
- Graph Representation - Adjacency Matrix and Adjacency List
- Dynamic Programming - Coin Change Problem
- Backtracking - N Queens Problem
- Inorder Predecessor and Successor in Binary Search Tree
- AVL Tree - Insertion