Pattern Searching Algorithms

1. Sorting Algorithms

Sorting algorithms are used to arrange the data in a specific order and use the same data to get the required information. Here are some of the sorting algorithms that are best with respect to the time taken to sort the data....

2. Searching Algorithms

Searching Algorithms are designed to check for an element or retrieve an element from any data structure where it is stored....

3. Pattern Searching Algorithms

The Pattern Searching algorithms are sometimes also referred to as String Searching Algorithms and are considered as a part of the String algorithms. These algorithms are useful in the case of searching a string within another string....

4. Divide and Conquer

As the name itself suggests It’s first divided into smaller sub-problems then these subproblems are solved and later on these problems are combined to get the final solution. There are so many important algorithms that work on the Divide and Conquer strategy....

5. Backtracking

Backtracking is a variation of recursion. In backtracking, we solve the sub-problem with some changes one at a time and remove that change after calculating the solution of the problem to this sub-problem. It takes every possible combination of problems in order to solve them....

6. Greedy Algorithm

A greedy algorithm is a method of solving problems with the most optimal option available. It’s used in such situations where optimization is required i.e. where the maximization or the minimization is required....

7. Dynamic Programming

Dynamic programming is one of the most important algorithms that is asked in coding interviews. Dynamic programming works on recursion. It’s an optimization of recursion. Dynamic Programming can be applied to all such problems, where we have to solve a problem using its sub-problems. And the final solution is derived from the solutions of smaller sub-problems. It basically stores solutions of sub-problems and simply uses the stored result wherever required, in spite of calculating the same thing again and again....

8. Tree Traversals Algorithms

Tree traversal refers to the process of visiting all nodes in a tree data structure, typically in a specific order. In other words, it’s the method of accessing and processing each node in a tree in a systematic way....

9. Graphs Algorithms

Breadth First Search (BFS): A graph traversal algorithm that explores all the vertices of a graph that are reachable from a given source vertex. Depth First Search (DFS): A graph traversal algorithm that explores all the vertices of a graph that are reachable from a given source vertex, by going as far as possible along each branch before backtracking. Dijkstra Algorithm: A shortest path algorithm that finds the shortest path between a given source vertex and all other vertices in a weighted graph. Floyd Warshall Algorithm: An all-pairs shortest path algorithm that finds the shortest path between all pairs of vertices in a weighted graph. Bellman-Ford Algorithm: A shortest path algorithm that can handle negative weight edges and detect negative weight cycles. Prim’s algorithm: A minimum spanning tree algorithm that finds the minimum spanning tree of a weighted, undirected graph. Kruskal’s algorithm: Another minimum spanning tree algorithm that finds the minimum spanning tree of a weighted, undirected graph....

10. Sliding Window

Window Sliding Technique is a computational technique that aims to reduce the use of nested loops and replace it with a single loop, thereby reducing the time complexity....