Only Code

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.

Algorithms, Computer Science, Special Data Structures

Comparing Order Statistics Algorithm and Min Heap for Finding the Kth Smallest Element

Both methods provide effective solutions for finding the kth smallest element in a list of numbers. Understanding their strengths and trade-offs will help you select the most suitable approach for your use case.

Algorithms, Computer Science, Heaps, Special Data Structures

UI Design : Circular Navigation vs Linear Navigation

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.

Web Development

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.

Arrays, Competitive Programming

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.

Algorithms, 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.

Graphs

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.

Algorithms

Array Indices with Equal sum | Equal Number of Odd or Even numbers on both sides

Given an array, find the indices where the sum of numbers on the left equals the sum on the right.

Arrays

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!

Algorithms, Backtracking & Recursion

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.

Algorithms, Graphs, Greedy approach