×
Home Discussions Write at Opengenus IQ
×
  • DSA Cheatsheet
  • HOME
  • Track your progress
  • Deep Learning (FREE)
  • Join our Internship 🎓
  • RANDOM
  • One Liner
OpenGenus Tech Review Team

OpenGenus Tech Review Team

The official account of OpenGenus's Technical Review Team. This team review all technical articles and incorporates peer feedback. The team consist of experts in the leading domains of Computing.

Tokyo, Japan •
3723 posts •
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
C++

Different ways to initialize List in C++ STL

In this article, we have explained Different ways to initialize List in C++ STL including Initializing list with elements of another list, using a vector or array and much more.

Aravind Mohandas Aravind Mohandas
Python

Different ways to terminate a program in Python

In this article, we are going to explore different ways in which we can terminate and exit a python program.

Dipto Chakrabarty Dipto Chakrabarty
JavaScript

Capturing and Bubbling in JavaScript (Event Listeners)

In this article, we will discuss about the concept of capturing and bubbling in JavaScript (Event Listeners) in depth with code demonstration.

Manikanta Nynala
Algorithms

Shortest distance between a Line and Point in 3D plane

In this article, we have presented two algorithms to find the Shortest distance between a Line and Point in 3D plane. This involves idea of Projection and Parallelogram.

Susmita Bhattacharya
JavaScript

Asynchronous programming in JavaScript

In this article, we have explored Asynchronous programming in JavaScript including ideas like callback, promises, async, await, loop and much more.

Katia Kaori Kaminishikwahara Katia Kaori Kaminishikwahara
Algorithms

Absolute value of Integer using Bitwise Operations

In this article, we have explained two approaches to find the Absolute value of Integer using Bitwise Operations namely Right shift, OR and XOR operations.

Shubhankar Maurya Shubhankar Maurya
Machine Learning (ML)

U-Net architecture

In this article, we have explained U-Net architecture along with other key ideas like Downsampling and Upsampling path with features and applications of U-Net.

Anubhav Tewari
Algorithms

Furthest Pair of Points (+ Rotating Calipers Method)

In this article, we have explained how to solve the problem of Furthest Pair of Points using Rotating Calipers Method. We have presented the naive approach as well.

Joe Gorst Joe Gorst
Compiler Design

Different Code Optimizations in Compiler Design

In this article, we have listed and explained Different Code Optimizations in Compiler Design such as Peephole optimization, loop unrolling, Loop-invariant code motion and much more.

Joe Gorst Joe Gorst
OpenGenus IQ © 2026 All rights reserved ™
Contact - Email: team@opengenus.org
Primary Address: JR Shinjuku Miraina Tower, Tokyo, Shinjuku 160-0022, JP
Office #2: Commercial Complex D4, Delhi, Delhi 110017, IN
Top Posts LinkedIn Twitter
Android App
Apply for Internship