×
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.

computational geometry

Euler’s Polyhedron Formula

In this article, we have explored Euler’s Polyhedron Formula in depth with examples, proof and applications in real life problems.

Akanksha Singh
Machine Learning (ML)

kn2row / kn2col Convolution

In this article, we will cover 2 different convolution methods: Kn2row and Kn2col Convolution which are alternatives to Im2row and Im2col. Kn2row and Kn2col are space efficient variants.

Aman Shrivastav
Time Complexity

Time and Space Complexity of Stack

In this article, we will explore about various operations on Stack Data Structure and the Time and Space Complexity of each operation for various cases like Best case, Average case and Worst case.

Mohd Ehtesham Uddin Qureshi Mohd Ehtesham Uddin Qureshi
Algorithms

Josephus Problem

In this article, we have explored and solved Josephus Problem in depth which is a Standard Problem in Computer Science. We have presented two solutions to Josephus Problem.

Aravind Mohandas Aravind Mohandas
Compiler Design

Parsing in Compiler Design

In this article, we discuss the different types of Parsing done by compilers such as Top-down parsing, Non-recursive predictive parsing and much more.

Erick Lumunge
Data Structures

Li Chao Segment Tree

In this article, we discuss the Li Chao tree, a segment tree which can be persistent and is faster in practice compared to the convex hull trick.

Erick Lumunge
Compiler Design

Symbol Table in Compiler

In this article, we have explored Symbol Table in Compiler in depth. We presented 3 different approaches to implement Symbol Table using Linear List, Tree and Hash Table data structures.

Harshita Singh Harshita Singh
Time Complexity

Time and Space complexity of Trie

In this article, we will understand the Complexity analysis of various Trie operations. We have covered Time and Space Complexity of Trie for various cases like Best case, Average Case and Worst Case.

Sanjana Babu
Machine Learning (ML)

Swish Activation Function

In this article, we have explored Swish Activation Function in depth. This was developed by Researchers at Google as an alternative to Rectified Linear Unit (ReLu).

Nana Kwame Kankam
System Design

System Design of Pastebin

In this article, we will be looking into the system design of Pastebin which is a content hosting service for simple text files. The scale of use of this applications makes the System Design interesting.

Thompson Mina
Data Structures

Persistent Trie

In this article, we discuss the Trie data structure and how to make it persistent to solve various problems optimally.

Erick Lumunge
Time Complexity

Time and Space Complexity of Heap data structure operations

In this article, we have explored the Time and Space Complexity of Heap data structure operations including different cases like Worst, Average and Best case. At the end, we have added a table summarizes the complexities.

Shubhankar Maurya Shubhankar Maurya
Machine Learning (ML)

Project on Reconstructing Face using PCA

In this article, we have demonstrated a project "face" where we find the set of faces when combined, resulting in face of person A. We do this using Machine Learning techniques like Principal Component Analysis, Face Reconstruction and much more.

Srishti Guleria Srishti Guleria
Algorithms

Delete middle element of Queue

In this article, we discuss how to delete the middle element of a queue without using other data structures. We have explained both iterative and recursive approach.

Erick Lumunge
Algorithms

Delete middle element of Stack

In this article, we discuss an iterative and recursive approach to delete the middle element of a stack.

Erick Lumunge
Algorithms

Nearest smaller and greater numbers with same number of set bits

In this article, we shall explore the various ways we can find the Nearest smaller and greater numbers with same number of set bits for given number.

J. Varun Iyer J. Varun Iyer
computational geometry

Find mirror image of point in 3D plane

In this article, we will learn how to find the mirror image of a point (x,y,z) in 3D-plane.

Kartik Keyan Kant Kartik Keyan Kant
Compiler Design

Error recovery in Compiler Design

In this article, we will discuss about various types of errors that occurs in the compiler design and what are those methods with the help of which this error can be recovered in a compiler.

Shwet Shukla Shwet Shukla
Compiler Design

Peephole Optimization in Compiler Design

In terms of compiler optimization, classical compilers used a method called Peephole Optimization, which is a powerful optimization approach.

Harshita Singh Harshita Singh
Machine Learning (ML)

SSD Model Architecture

SSD has been defined as “a method for detecting objects in images using a single deep neural network”. But before we get into that let us first understand what object detection means.

Mainak Debnath
Machine Learning (ML)

Exponential Linear Unit (ELU)

Exponential Linear Unit (ELU) is an activation function which is an improved to ReLU. We have explored ELU in depth along with pseudocode.

Nana Kwame Kankam
Machine Learning (ML)

Im2row Convolution

In this article, we will understand about Im2row Convolution which is an approach to perform Convolution by modifying the layout of image and filter. It is a better alternative to Im2col.

Aman Shrivastav
Algorithms

Longest Substring with at Least K repeating characters

In this article, we have presented two algorithms to find the Longest Substring with at Least K repeating characters.

Raghu Ramjee Raghu Ramjee
Algorithms

Find smallest of 3 integers without comparison

In this guide, we will go through how to get the smallest of three numbers without using Comparison operation. We have presented 3 different techniques using decrement, division and shift operation.

Harshita Singh Harshita Singh
Algorithms

Legendre's conjecture

In this article, we have explained Legendre's conjecture, presented an implementation of an Algorithm to verify Legendre's conjecture till a given limit and have provided output which you can analyze.

Shwet Shukla Shwet Shukla
OpenGenus IQ © 2026 All rights reserved ™ [email: team@opengenus.org]
Top Posts LinkedIn Twitter