Maximum Length Chain of Pairs – Dynamic Programming – The given problem is also a variation of Activity Selection problem and can be solved in (nLogn) time.
Algorithm
263 Articles
263
PYTHON programming-Check if a graph is strongly connected | Set 1 (Kosaraju using DFS) – find out whether the graph is strongly connected or not
Travelling Salesman Problem – Approximate using MST – The cost of the output produced by the above algorithm is never more than twice the cost of best
JAVA programming-Check if a graph is strongly connected | Set 1 (Kosaraju using DFS)-find out whether the graph is strongly connected or not
C Programming – Word Wrap Problem – Dynamic Programming Given a sequence of words, and a limit on the number of characters that can be put in one line
C++ Programming – Word Wrap Problem – Dynamic Programming Given a sequence of words, and a limit on the number of characters that can be put in one line
C programming – Check if a graph is strongly connected – A directed graph is strongly connected if there is a path between any two pair of vertices
Java Programming – Word Wrap Problem – Dynamic Programming Given a sequence of words, and a limit on the number of characters that can be put in one line
Travelling Salesman Problem – Naive and Dynamic Programming – Travelling Salesman Problem (TSP): Given a set of cities and distance between every pair
C Programming – Binary representation of a given number – Bit Algorithm – Write a program to print Binary representation of a given number.