## Finding the Actual Longest Common Subsequence from Dynamic Programming Table

It aims to find the longest subsequence present in both input sequences, where a subsequence is a sequence that appears in the same relative order but not necessarily consecutively.

## Sudoku Solver using Backtracking

Let’s implement a Sudoku solver using a backtracking & recursive algorithm for the grid of variable size (N x N).

## Estimating Percolation in a Matrix Network

Dynamic connectivity algorithms provide an efficient way to model and analyze percolation in a grid of sites.

## Finding Permutations that Form the Sum | Coin Change Permutation

Find the number of permutations to form the target sum using the elements of the given array, with repetition allowed.

## Stable Marriage Problem Solution

Stable Marriage Problem is a problem in computer science of finding a stable matching between two equally sized sets based on preferences.

## Solving the Fractional Knapsack Problem

While the 0/1 Knapsack problem restricts you to take an item entirely, Fractional Knapsack problem allows you to take fractions of an item.

## Travelling Salesman Problem using Held-Karp Algorithm | Dynamic Programming

The Held-Karp algorithm is an efficient dynamic programming approach for solving the Travelling Salesman Problem (TSP). The algorithm builds up a table to store the optimal cost of visiting subsets of cities.

## Travelling Salesman Problem using Nearest Neighbour Algorithm

Given a list of cities and the distances between each pair of cities, find the shortest possible route that visits each city exactly once and returns to the origin city.

## Comparing Performance of Disjoint-Set Algorithms: Quick Union, Quick Find, and Weighted Quick Union

Disjoint-set data structures, commonly known as Union-Find, are fundamental data-structures in computer science for efficiently solving problems related to connectivity in graphs or set operations.

## Mersenne Twister Algorithm vs rand(): Generating Random Numbers

Understanding the differences between the Mersenne Twister algorithm and rand() method helps in selecting the appropriate method based on specific programming needs.