Check if a graph is strongly connected or not
Given a directed graph, check if it is strongly connected or not. A directed graph is said to be strongly connected if every vertex is reachable from every other vertex.
Tag: Easy
Transitive closure of a graph
The transitive closure for a digraph G is a digraph G’ with an edge (i, j) corresponding to each directed path from i to j in G. The resultant digraph G’ representation in the form of the adjacency matrix is called the connectivity matrix.
Arrival and departure time of vertices in DFS
The arrival time is the time at which the vertex was explored for the first time in the DFS, and departure time is the time at which we have explored all the neighbors of the vertex, and we are ready to backtrack.
Reverse a string using recursion – C, C++, and Java
Write a recursive program to efficiently reverse a given string in C, C++, and Java.
Iterative solution to reverse a string in C++ and Java
Write an iterative program to reverse a string in C++ and Java.
Recursive program to calculate factorial of a number
Write a recursive C/C++, Java, and Python program to calculate the factorial of a given positive number.
Find all factorial numbers less than or equal to n
Write a recursive program to find all factorial numbers less than or equal to n. The factorial n! of a non-negative integer n is the product of all positive integers less than or equal to n.
Iterative program to find factorial of a number
Write an iterative C/C++ and java program to find factorial of a given positive number.
Efficiently print factorial series in a given range
Write an iterative program to print factorial series in a given range efficiently. The factorial n! of a non-negative integer n is the product of all positive integers less than or equal to n.
Determine whether a number is a palindrome or not
Write a program to determine if a given number is a palindrome or not. A palindromic number is a number that remains the same when its digits are reversed.
Find maximum number without using conditional statement or ternary operator
Given two numbers, calculate the maximum number without using a conditional statement or ternary operator.
Single line expressions to swap two integers in Java
Given two integers, swap them in a single line in Java.