C++ Algorithm – Maximum Bipartite Matching – Graph Algorithm – A matching in a Bipartite Graph is a set of the edges chosen in such a way
Algorithm
263 Articles
263
Python Algorithm – Maximum Bipartite Matching – Graph Algorithm – A matching in a Bipartite Graph is a set of the edges chosen in such a way
swap two numbers without using a temporary variable-Bit Algorithm-Given two variables, x and y, swap two variables without using a third variable.
Java Algorithm – Maximum Bipartite Matching – Graph Algorithm – A matching in a Bipartite Graph is a set of the edges chosen in such a way
It is quite easy to visualize this statement since the median which we report will be (k/2)th element and if we take k/2 elements from the left quarter.
Karatsuba algorithm for fast multiplication – Given two binary strings that represent value of two integers, find the product of two strings.
Greedy Algorithms Boruvka’s algorithm – Minimum Spanning Tree Like Prim’s and Kruskal’s, Boruvka’s algorithm is also a Greedy algorithm.
C Programming Find position of the only set bit – Given a number having only one ‘1’ and all other ’0’s in its binary representation.
Given a dictionary, and two words ‘start’ and ‘target’ (both of same length). Find length of the smallest chain from ‘start’ to ‘target’ if it exists.
Given an unsigned integer, swap all odd bits with even bits. For example, if the given number is 23 (00010111), it should be converted to 43 (00101011).