These are the articles, dedicated specifically to advanced competitive programming concepts. Modular Multiplicative Inverse, Nth Catalan Number.

Circular navigation allows users to move through a list in a circular pattern. It is often used in websites and apps with a lot of content.

## Search a sorted 2D Matrix

This method has the limitation that it will work for only those matrix where the first integer of each row is greater than the last integer of the previous row.

## Minimum Moves to Equal Array Elements – LeetCode Solution [Medium]

When we increment n – 1 elements, the relative difference between the highest number and all other numbers effectively decreases by 1.

## Java Notes | Abstract class & Multi-level Inheritance

Each child class in the hierarchy is responsible for implementing abstract methods that have not been implemented by its superclasses.

## Understanding P, NP, and NP-Complete

This so-called P ≠ NP question has been one of the deepest, most perplexing open research problems in theoretical computer science.

## Why is a Bipartite graph with an odd number of vertices a Non-Hamiltonian graph?

A Hamiltonian cycle, also known as a Hamilton cycle or Hamiltonian circuit, is a cycle in a graph that visits every vertex exactly once, except for the starting vertex.

## Knuth-Morris-Pratt (KMP) | String Searching Algorithm

The KMP algorithm improves the efficiency of string searching by utilizing the information gathered from previous character comparisons. It avoids unnecessary character comparisons by exploiting the knowledge of the pattern itself.

## Permutations of a string

Each of these permutations represents a unique arrangement of the elements. Total number of permutations of a set will always be n!

## Understanding Prim’s Algorithm for Minimum Spanning Tree in C++

Prim’s Algorithm is a popular greedy algorithm used to find the Minimum Spanning Tree (MST) of a connected, weighted graph.

## Minimum Spanning Tree (MST) | Kruskal’s Algorithm in C++

Kruskal’s algorithm is one of the popular algorithms used to find an MST in a connected weighted graph. This algorithm is efficient, easy to understand, and guarantees the construction of a minimum-weight spanning tree.