×
Home Discussions Write at Opengenus IQ
×
  • FREE ALGO BOOK
  • About
  • Track your progress
  • Deep Learning (FREE)
  • Python Projects
  • Join our Internship πŸŽ“
  • RANDOM
  • 100+ Graph Algorithms
  • 100+ DP Problems
  • 50+ Linked List Problems
  • 50+ Array Problems
  • One Liner
  • 50+ Binary Tree problems
  • Home
  • Rust Projects

Algorithms

Algorithms have proven to be the most important domain over the last century which has reformed the way we do tasks. It is actively used to design industry systems and forms the building blocks of companies like Google. We cover all types of algorithms in depth

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.

Manraj Singh Manraj Singh
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.'

Bogdan Munteanu Bogdan Munteanu
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.

Himanshu Dubey
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'.

Pranay Kalakonda
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.

Kavya Mothukuri
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.

Pranay Kalakonda
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.

Odai S. Alazzeh Odai S. Alazzeh
Algorithms

Dynamic Optimality Conjecture: Unlocking BST Efficiency

In this article at OpenGenus, we will examine Dynamic Optimality Conjecture, from its basic characteristics through its prospective applications and advantages in the actual world.

Abraham Roy
Algorithms

Shell Metzner sort

The Shell-Metzner sort is a modified version of a sorting method called Shell sort. It was developed by Marlene Metzner to make it work even better.

 Rishi Shivhare Rishi Shivhare
Algorithms

Next Greater Element using Stack

Given an array of integers, arr, of length N. The task is to find the Next Greater Element (NGE) for each element in the array.

Kavya Mothukuri
Algorithms

Task Scheduler - Algorithm and Data Structure Project [in JavaScript]

In this article at OpenGenus, we are going to build a task scheduler project which implements a priority queue, and we will use a min heap data structure to manage the tasks based on their priorities.

Virag Kormoczy Virag Kormoczy
Java

Implementing Merge Sort in Java

In this article at OpenGenus, we have explored the design and implementation of Merge Sort in Java Programming Language.

Hiten Samalia Hiten Samalia
Data Structures

Mean of Array problem solved with Treap

In this article at OpenGenus, we have solved the Mean of Array problem using Treap Data Structure.

Aswin Shailajan
Data Structures

Ghost Town problem solved with Treap Data Structure

In this article at OpenGenus, we will discuss the Ghost town problem. This involves the concept of Treap data structure.

Aswin Shailajan
Python

Linear Search in Python using OOP Concepts

In this article at OpenGenus, we will explore how to implement the linear search algorithm in Python using Object-Oriented Programming (OOP) concepts.

Shreya Garrepelly
Data Structures

Swarm Intelligence for Distributed Data Structures

Distributed data systems provide a way of organising and managing data across interconnected computers or devices. It provides benefits such as scalability, fault tolerance and data synchronization.

Agniva Maiti Agniva Maiti
quick sort

Quick Sort in Python using OOP

In this article at OpenGenus, we will explore the implementation of Quick Sort in Python using the principles of Object-Oriented Programming (OOP). By utilizing classes and objects, we'll implement the Quick Sort algorithm to efficiently sort arrays or lists of elements.

MATHANKUMAR V
Algorithms

27 Algorithm and Data Structure Project Ideas

In this article at OpenGenus, we will list important and unique project ideas that have algorithmic approaches behind them.

Virag Kormoczy Virag Kormoczy
C++

Selection Sort in C++ using Inheritance and Template - Recursive and Iterative

In this article at OpenGenus, we will explore how to implement Selection Sort in C++ using the principles of object-oriented programming (OOP) and templates. We will define both recursive and iterative approaches to the algorithm.

Arravelly Keerthi
Algorithms

Fast Fourier Transformation and its Application in Polynomial Multiplication

The Fast Fourier Transformation (FFT) is an algorithm for computing the discrete Fourier transform (DFT) of a sequence. The DFT is a mathematical operation that converts a sequence of numbers into a sequence of frequencies.

Mizbaul Haque Maruf Mizbaul Haque Maruf
Algorithms

Arithmetic coding (encoding + decoding)

Arithmetic coding is a sophisticated method to compress data based on the probability of occurrence of each unique symbol in a message.

Thi Canh Phuc Dao Thi Canh Phuc Dao
Algorithms

Binary Search on Answer

Binary search is commonly associated with sorted arrays, but it can also be applicable to unsorted arrays in certain cases. These types of problems are known as "binary search on answer" problems.

Arravelly Keerthi
Algorithms

Israeli Queue

The Israeli Queue is also a variation for the priority queue because elements in it also have priority. However, the priority is determined by their "friendship" with a friend.

Yingzi Tang Yingzi Tang
Algorithms

Space Time Complexity [Computer Science]

In this article at OpenGenus, we have covered the concept of Space Time Complexity in depth which is a must in Algorithmic Analysis.

Manish Kumar Manish Kumar
Algorithms

Mario less and Mario more - CS50 Exercise

In this article at OpenGenus, we have solved the Mario less and Mario more problem in CS50. This involves printing a pattern.

Manish Kumar Manish Kumar
OpenGenus IQ © 2023 All rights reserved β„’ [email: team@opengenus.org]
Top Posts LinkedIn Twitter