×
Home Discussions Write at Opengenus IQ
×

Search anything:

  • DSA Cheatsheet
  • HOME
  • Track your progress
  • Deep Learning (FREE)
  • Join our Internship 🎓
  • RANDOM
  • One Liner

OpenGenus IQ, an open-source Computer Science Publication House, is driven by 2500+ BSc/MSc/PhD holders globally, exploring Algorithms, Deep Learning, System Design, and more since 2017.

Time Complexity

Time & Space Complexity of Binary Tree operations

In this article, we will be discussing Time and Space Complexity of most commonly used binary tree operations like insert, search and delete for worst, best and average case.

Mohd Ehtesham Uddin Qureshi Mohd Ehtesham Uddin Qureshi
Algorithms

Number of Integral points inside a rectangle

In this article, we have explored an insightful approach/ algorithm to find the number of interior integral points of a rectangle. This is an important concept in the field of computational geometry.

Rohan Chandrashekar Rohan Chandrashekar
Algorithms

Voronoi Diagram

In this article, we discuss the voronoi diagram in depth and how to use Fortunes Sweep Line algorithm to compute it. This is an important topic in Computational Geometry.

Erick Lumunge
Algorithms

Oriented area of a triangle

In this article, we discuss how to find the area of an oriented Polygon using the shoelace algorithm and as an example we find the area of an oriented triangle.

Erick Lumunge
Algorithms

Self Crossing Problem

This article delves into the illustrious Self Crossing problem and looks at how we can solve it. This can be solved efficiently using Computational Geometry ideas.

Thompson Mina
Algorithms

Select a random node from Linked list

In this article, we have presented two algorithms to select a random node from Linked list efficiently while maintaining uniform randomness.

Suraj Kumar Suraj Kumar
Algorithms

Swap two bits in a number

In this problem, we have to swap bits in a given number or an integer. This can be solved in constant time O(1) using XOR operation.

Shwet Shukla Shwet Shukla
JavaScript

Array in JavaScript

In this article, we have explored Array in JavaScript in depth along with multi-dimensional array and different array methods like splice(), push() and more.

Katia Kaori Kaminishikwahara Katia Kaori Kaminishikwahara
JavaScript

OOP in JavaScript

In this article, we will talk about Object Oriented Programming (OOP) in JavaScript and have covered different ideas like Inheritance, Encapsulation, Design Patterns and much more.

Kirti Singh
System Design

Concept of Reverse Proxies

In this article, we have explained the Concept of Reverse Proxies, why it is important and the applications of Reverse Proxies. This is an important topic in System Design.

Abba Bawa Abba Bawa
Algorithms

Union of Two Arrays

In this article, we have explained different approaches to find Union of Two Arrays and provided implementations in C++, Java and Python.

Susmita Bhattacharya
Rust Programming

Unsafe Rust

Rust has a lot of safety checks that ensure memory safety and allow us to completely avoid a lot of the common errors that plague other languages with unrestricted memory freedom.

Gabriel Puiggros Gabriel Puiggros
Algorithms

Check if given point is inside a convex polygon

In this post, we discuss how to check if a given point is inside a convex polygon using the Graham scan algorithm and list application areas for the solution.

Erick Lumunge
JavaScript

Basics of JavaScript (variable, datatype, function, array, loop and more)

In this article, we have explained the Basics of JavaScript (variable, datatype, function, array, loop and more).

Katia Kaori Kaminishikwahara Katia Kaori Kaminishikwahara
Rust Programming

Different ways to terminate and pause program in Rust

Rust has multiple built-in ways to terminate the program, and every method has specific behavior whenever it's called. We're going to see how different functions in Rust (which we use to exit the program) act and how to use them.

Shubhankar Maurya Shubhankar Maurya
Algorithms

Pick’s Theorem in Computational Geometry

In this post, we discuss Pick's theorem, its proof and example use cases where its application would be efficient to solve a problem. Using Pick's Theorem, we can compute the area of simple polygons.

Erick Lumunge
Algorithms

Consistent Hashing

Consistent Hashing is a distributed hashing scheme that operates independently of the number of servers in a distributed hash table.

Mohd Ehtesham Uddin Qureshi Mohd Ehtesham Uddin Qureshi
Algorithms

Number of Integral points inside a triangle

In this article, we have explored an insightful approach/ algorithm to find the number of interior integral points of a triangle. This is an important concept in the field of computational geometry.

Rohan Chandrashekar Rohan Chandrashekar
List of Mathematical Algorithms

Pollard’s rho algorithm for factorization

Pollard's Rho Algorithm is a very interesting and quite accessible algorithm for factoring numbers. It was invented by John Pollard in 1975. It is not the fastest algorithm by far but in practice it outperforms trial division.

Shwet Shukla Shwet Shukla
Rust Programming

Deep Dive: Strings in Rust

I've gone into Strings briefly in the beginner's article, but this time, we're going to explore them a little bit more in depth. I will cover some aspects I've already covered only to keep a full 0 to almost 100% info on strings in a single article.

Gabriel Puiggros Gabriel Puiggros
Machine Learning (ML)

Binary Step Function

Binary step function is one of the most common activation function in neural networks out there. But before we get into it let's take a look at what activation functions and neural networks are.

Mainak Debnath
Algorithms

List of Randomized Algorithms

In this article, we have listed several important Randomized Algorithms such as Fisher Yates shuffle, Minimum Cut with Karger's, Matrix Product Verification and many more.

Joe Gorst Joe Gorst
Machine Learning (ML)

Different types of CNN models

In this article, we will discover various CNN (Convolutional Neural Network) models, it's architecture as well as its uses. Go through the list of CNN models.

Aman Shrivastav
Software Engineering

First, Best and Worst fit Strategies (Memory Allocation Strategies)

In this article, we will be going through a few strategies which Operating Systems use to fit processes into the main memory during execution. This include First, Best and Worst fit Strategies.

Hariharan Marthandam J
Algorithms

Find mirror image of point in 2D plane

In this article, we will learn how to find the mirror image position of a point in a 2D plane along with C++ implementation of the approach.

Kartik Keyan Kant Kartik Keyan Kant
OpenGenus IQ © 2026 All rights reserved â„¢ [email: team@opengenus.org]
Top Posts LinkedIn Twitter