Algorithms

Hashing

Chameleon Hash: Balancing Security and Flexibility in Cryptographic Hashing

In this OpenGenus article, we examine the key properties of Chameleon hash functions, their construction, and their potential applications, and provides an overview of their advantages and limitations in modern cryptographic systems.

Algorithms

Navigating the Vibrant Landscape of Chromatic Art Gallery Problems

In this insightful expedition at OpenGenus, we will traverse the complexities of guarding polygonal masterpieces, exploring its NP-hard intricacies and delving into variant landscapes that challenge the very essence of guarding with colors.

Algorithms

DAILY 43: Algorithmic Problems for Coding Interviews: Easy level, C++ edition

This book "DAILY 43: Algorithmic Problems for Coding Interviews, Easy level, C++ edition" is the book you need to master Algorithm and Data Structure problems for Coding Interviews.

Algorithms

Hierholzer’s Algorithm and Solving Reconstruct Itinerary Problem

This article will guide you through the intuition of how to solve the problem using the concept of Hierholzer’s Algorithm which is frequently asked in coding interviews of various tech companies.

Algorithms

Zeller’s Congruence

Zeller's Congruence is a mathematical algorithm devised by Christian Zeller to calculate the day of the week for any date in both the Julian and Gregorian calendars.

Algorithms

Quick Sort using Queue

In this OpenGenus, we have explored how to implement Quick Sort using Queue data structure. Usually, stack data structure is used with Quick Sort.

Algorithms

Minimum Absolute Difference Between Elements With Constraint

In this article at OpenGenus, we will solve the problem called Minimum Absolute Difference Between Elements With Constraint. The article will guide you through the intuition of how to solve the problem using the concept of Binary Search and Ordered Set.

Algorithms

Maximum Profit by Buying and Selling a Share at Most k Times

In this article at OpenGenus, we will solve the problem of getting maximum profit by buying and selling a share at most k times.

game theory

Game Playing: Adversarial Search

The goal of adversarial search is to create an intelligent agent that can make decisions to maximize its chances of winning the game. The agent needs to consider the possible moves of both players and anticipate the outcomes of these moves to make informed decisions.

Greedy Algorithms

Master Greedy Algorithm with 7 Basic Problems [Solution + Code included]

In this article at OpenGenus, we will discuss the about how to master greedy algorithms by solving 7 basic problems using greedy algorithmic ideas.

Algorithms

Cook-Levin's Theorem

The Cook–Levin theorem, states that the Boolean satisfiability problem(SAT) is NP-complete.

Algorithms

Modular Multiplication in C++

Modular arithmetic is a branch of number theory that deals with operations on numbers that have a remainder when divided by a modulus. In C++, performing modular arithmetic involves using the % (modulo) operator and sometimes ensuring that the result remains within a specified range.

System Design

Library Management System using Binary Search Tree (BST) [with source code]

In this article at OpenGenus.org, we will guide you through the creation of a Library Management System (LMS) using the Binary Search Tree (BST) data structure.

Algorithms

Fowler-Noll-Vo (FNV) Hash Algorithm

The FNV (Fowler-Noll-Vo) hash algorithm is a non-cryptographic hash function designed for fast hashing of small to medium-sized data. It was created by Glenn Fowler, Landon Curt Noll, and Kiem-Phong Vo.

Data Structures

Anagram Trees

The objective of this OpenGenus article is to explore the concept of utilizing anagram trees, a specialized tree structure, to efficiently organize and retrieve anagrams of words.

Graph Algorithms

Longest Increasing Path in a Matrix [4 approaches explained]

This problem involves navigating a 2D matrix to find the longest path such that each element in the path is strictly greater than the previous one.

Algorithms

Find Second Smallest and Second Largest Element in an array

This article at OpenGenus.org explores both a brute-force approach and an optimized technique to find Second Smallest and Second Largest Element in an array, followed by real-world scenarios where such analysis proves valuable.

Algorithms

Rendezvous hashing

Rendezvous hashing was invented by David Thaler and Chinya Ravishankar at the University of Michigan in 1996.

Algorithms

Solving Course Scheduling Problem using Topological Sort

In this article at OpenGenus, we will solve the famous course scheduling problem and it's variations using the graph algorithm known as Topological Sort.

Algorithms

Legendre and His Formula: Speeding Up Factorial Calculations

Factorial calculations are a fundamental mathematical operation in computer science, commonly used in algorithms and equations. The factorial of a non-negative integer 'n' is defined as the product of all positive integers from 1 to 'n.'

Algorithms

Finding Exponent of a Number [5 approaches]

Exponent is a method of expressing large numbers in terms of powers. It refers to how many times a number is multiplied by itself.

Algorithms

Ceiling in a Sorted Array

You are given a sorted array of integers and a target value 'x'. Your task is to find the lower bound, which is the smallest element in the array that is greater than or equal to 'x'.

Algorithms

Next Greater Frequency Element

This problem involves combining the concepts of frequency counting and stack-based processing to efficiently determine the next element with a higher frequency for each element in the array.

Algorithms

Minimize Maximum Distance between Gas Stations [Solved 3 approaches]

You are given a sorted array ‘arr’ of length ‘n’, which contains positive integer positions of ‘n’ gas stations on the X-axis. You are also given an integer ‘k’. You have to place ‘k’ new gas stations on the X-axis.

Algorithms

Approximate String Matching

In computer science, approximate string matching involves seeking strings in a text that closely resemble a specified pattern. In simpler terms, it's a method of searching for text matches, even when users input words with errors or provide incomplete search terms.