C Program to find which character occurs the maximum number of times in a string in O(n) time

In this program we used STL unordered_map , where character of the string is working as a key to the number of its occurrences. C++ Program to find which character occurs the maximum number of times is given below. This program is successfully executed and tested on online compiler.

C Program for Implementation of Selection Sort

Selection sort is a sorting algorithm, specifically an in-place comparison sort. It sorts an array by finding the minimum element in every iteration. This algorithm finds the lowest element in the array and place it at first position in first iteration, second lowest element in second iteration and so on.

C Program for deletion of a node from any position in doubly Linked List

Doubly Linked List is a variation of Linked List in which traversal is possible in both directions, forward and backward. Doubly Linked List have two fields one is data field and other is link fields. Link fields itself contain two pointers, next and prev.

C++ Program to check if a Directed Graph is Strongly Connected or Not

A directed graph is said to be strongly connected when it is possible to visit every node of the graph from any node. Here we are discussing simple approach to check if a directed graph is strongly connected nor not.

Prerequisite:- BFS algorithm must be known to check is the directed graph is strongly connected or not. If you don't know BFS (Breadth First Search) algorithm or implementation click the link given below.