Find whether a given number is a power of 4 or not – Bit Algorithm – A simple method is to take log of the given number on base 4, and if we get an integer.
Algorithm
C++ Programming – Print all possible combinations of r elements in a given array of size n – Mathematical Algorithms – Given an array of size n, and r is 2.
Python Programming – Min Cost Path – Dynamic Programming – MCP problem has both properties of a dynamic programming problem. Like other typical DP problems.
Java Programming – Min Cost Path – Dynamic Programming the MCP problem has both properties of a dynamic programming problem. Like other typical DP problems,
C++ Programming – Min Cost Path – Dynamic Programming – the MCP problem has both properties of a dynamic programming problem. Like other typical DP problems,
Java algorithm – Breadth First Traversal or BFS for a Graph – Breadth First Traversal for a graph is similar to Breadth First Traversal of a tree.
Turn off the rightmost set bit – Bit Algorithm – Let the input number be n. n-1 would have all the bits flipped after the rightmost set bit .
C Programming – Union-Find Algorithm | Set 1 (Detect Cycle in an Undirected Graph) – Graph Algorithms – A disjoint-set data structure is a data.
Java Programming – Union-Find Algorithm | Set 1 (Detect Cycle in an Undirected Graph) – Graph Algorithms – A disjoint-set data structure is a data.
C++ Programming – Union-Find Algorithm | Set 1 (Detect Cycle in an Undirected Graph) – Graph Algorithms – A disjoint-set data structure is a data.