×
Home Discussions Write at Opengenus IQ
×
  • Track your progress
  • Deep Learning Projects
  • 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

Complexity analysis of Sieve of Eratosthenes

In this article, we will discuss the Sieve of Eratosthenes method for identifying prime numbers, including its implementation, computational complexity, and alternative solutions.

Abhijeet Saroha
Greedy Algorithms

Assign Cookies problem

Assign cookies problem is a popular coding interview question which is mostly solved using greedy algorithm. Here, you will be given a list of children/siblings and a list of cookies with their sizes.

Abeeb Raheem Abeeb Raheem
C++

Multi-thread C++ program to find all prime numbers < N

In this article, we have developed a Multi-thread C++ program to find all prime numbers < N. We have covered Sieve or Eratosthenes algorithm and used thread in C++.

Gabriel
Algorithms

Time & Space Complexity of Tower of Hanoi Problem

In this article, we will discuss about time and space complexities of Tower of Hanoi problem for different cases like worst case, best case and average case.

Bhavani Sankar Nagarapu Bhavani Sankar Nagarapu
Sorting Algorithms

Modified Bubble Sort

Modified Bubble Sort or Short bubble sort is a variation of the standard bubble sort algorithm that improves the best-case time complexity from O(n^2) to O(n) by using a flag to check if the array is already sorted.

Anay Dongre
Algorithms

Largest sub-array with equal number of 1 and 0

In this article, we have explored 3 different approaches to find the Largest sub-array with equal number of 1 and 0. This involve the concept of Hash Map/ Set and Prefix Sum.

Bhavani Sankar Nagarapu Bhavani Sankar Nagarapu
Algorithms

Height Checker Problem

In this article, we have solved the Height Checker Problem with two different approaches. This involve the concept of using Counting Sort efficiently.

Harshit Raj
backtracking

Parallel Backtracking

In this article, we have covered the Parallel Backtracking algorithm. We have presented the Time and Space Complexity for various cases.

CHEW Chee Keng
backtracking

Disadvantages of Backtracking

In this article, we have covered the Disadvantages of Backtracking algorithm.

CHEW Chee Keng
Algorithms

Advantages and Disadvantages of Huffman Coding

In this article, we will discuss about 5 advantages and 5 disadvantages of Huffman Coding.

Bhavani Sankar Nagarapu Bhavani Sankar Nagarapu
backtracking

Backtracking vs Branch and Bound

In this article, we have compared Backtracking vs Branch and Bound algorithms.

CHEW Chee Keng
Algorithms

H-index problem

Calculate the researcher's h-index from an array of integer citations, where citations[i] is the number of citations a researcher obtained for their ith work.

Harshit Raj
C Programming

Matrix Multiplication in C

In this article, we are going to perform the matrix multiplication operation using C language. We will also be learning how to optimize it using Strassen's algorithm.

Harshit Raj
Data Structures

Applications of 24 Different Data Structures

In this article, we have listed and explained the real-life applications of 24 Different Data Structures ranging from common ones like Array, Linked List to Geometric Data Structures like R-Tree to Probabilistic Data Structures like LogLog.

Aswin Shailajan
Data Structures

(a,b) Tree Data Structure

An (a,b)-tree is a type of self-balancing tree data structure that is designed to maintain a balance between the height of the tree and the number of elements stored in the tree. In short we can say that (a,b)-tree is a generalization of a B-tree. Now lets get to know it in depth.

Aswin Shailajan
Algorithms

5 Advantages of Huffman coding

In this article, we have explored the 5 advantages of Huffman coding and why it is one of the best encoding method despite being so simple.

Rohit Topi
Algorithms

2D Prefix Sum

In this article, we discuss about how to find the Prefix sum of a given matrix that is 2D Prefix Sum. We have demonstrated 3 methods to find the 2D prefix sum.

Harsit Agarwalla
Graph Algorithms

Biconnected Components [Explained + Algorithm to find it]

Turns out, biconnected components are one of the most important topic in design analysis of algorithms, data structures and in many competitive exams. Biconnected components are defined as a maximal biconnected subgraph.

Aswin Shailajan
Software Engineering

How Speed Test Work?

In this article, we have explored how Internet Speed is measured which involves upload and download speed. This will help you understand how speed test by Ookla works and how you can create a similar tool to measure Internet Speed.

Oluwafunsho Anthony Oluwafunsho Anthony
Algorithms

L-Systems and Carnatic Music

Ever been amazed by plant's geometry? Lindenmayer systems,in short , L-systems have been inspired by the recurrence pattern observed in plants. We will learn more about L-systems , its history , applications and learn how L-systems were used to generate plants and trees models, snowflakes and so on.

Rashmitha
Algorithms

Magic Dictionary Problem [Solved]

In this article we are going to discuss a famous Leetcode medium level problem called "Implement Magic Dictionary" problem. This will involve the concept of Hash Table/ Map and Tries.

Harshit Raj
List of Mathematical Algorithms

Brocard’s conjecture

The Brocard conjecture states that the number of prime numbers lying between the squares of two consecutive prime numbers is four or more.

Harshit Raj
Algorithms

Perlin Noise (with implementation in Python)

One of the most important algorithms in computer graphics and procedural generation is Perlin Noise. Perlin Noise is an algorithm that generates textures and terrain-like images procedurally (without the need for an artist to manually create the images).

Akanksha Singh
prefix sum array

Corporate Flight Bookings problem [Solved]

In this article, we will solve Corporate Flight Bookings problem using prefix sum algorithm. In naïve approach, it will take a quadratic O(N^2) time complexity but using a prefix sum approach we can get better time complexity.

Abrham Lakew
Data Structures

Abstract Data Type in Data Structure

In this article, we have explained the concept of Abstract Data Type in Data Structure in depth along with code examples and theoretical examples of Data Structures. The best examples of Abstract Data Type come from C++ STL (Standard Template Library) and Java Collections.

Shlok Singh
OpenGenus IQ © 2023 All rights reserved â„¢ [email: team@opengenus.org]
Top Posts LinkedIn Twitter