×
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 •
Deep Learning

ShuffleNet Series (Part 2): A Comparison with Popular CNN architectures

This article covers the comparison of ShuffleNet with some famous architectures. It also covers how well the newer variants of ShuffleNet are as compared to their older counterparts.

Neeha Rathna Janjanam Neeha Rathna Janjanam
Machine Learning (ML)

BERT Large Model

BERT large model is a pretrained model on English language which uses a Masked Language Modeling (MLM for short). It has 24 encoder layers.

Akshay Atam
Algorithms

Implement K stacks in one array

In this article, we have present two approaches to design K stacks in one array. The challenge is to efficiently store the elements to use all available space in the array and maintain the time complexity of stack operations.

Vikram Shishupalsingh Bais Vikram Shishupalsingh Bais
Algorithms

Longest substring without repeating characters

In this article, we have explained three approaches to the problem of finding Longest substring without repeating characters. This involves the use of Hash Map with the clever use of start and end index.

Akanksha Singh
Algorithms

Integer to Roman Numeral Conversion

In this article, we have presented the algorithm to Convert Integer to Roman Numerals along with C++ implementation and step by step implementation.

Katia Kaori Kaminishikwahara Katia Kaori Kaminishikwahara
Rust Programming

MPSC messages + Shared-State Concurrency in Rust

In this article, we have presented the idea of MPSC messages + Shared-State Concurrency in Rust along with Mutex. Pointer, Smart Pointer, Reference Counting and Atomic Reference Counting.

Gabriel Puiggros Gabriel Puiggros
Algorithms

Closest 3 Sum problem (Find all triplets close to the given sum)

In this article, we have explored an insightful approach/ algorithm to find the 3 elements in an array whose sum is equal to or close to the required answer. This is an extension of the 3 Sum problem where the resulting sum needed not be exact.

Rohan Chandrashekar Rohan Chandrashekar
JavaScript

Build a Web Server in ExpressJS

We have explained how you can build a Web Server in ExpressJS, a Node.js framework along with the basics of web server.

Fahd Agodzo Mohammed Fahd Agodzo Mohammed
Software Engineering

Get CO2 emission data using Carbon Intensity API

In this article, we have explored how to get CO2 emission data for a specified time period and for specific location. For this, we have used Carbon Intensity API and have implemented the code in Python.

Katia Kaori Kaminishikwahara Katia Kaori Kaminishikwahara
Java

Interview Questions in Java (MCQ)

In this article, we have presented several Interview Questions in Java (MCQ) covering all important topics in Java. These questions are frequently asked in Coding Interviews and you must attempt these questions.

OpenGenus Tech Review Team OpenGenus Tech Review Team
Rust Programming

Message-Sending Concurrency in Rust

In this article, we have covered the idea of Closures and Communication using Multiple Producer Single Consumer (MPSC) in Rust.

Gabriel Puiggros Gabriel Puiggros
Cloud Computing

Containerization

In this article, we will learn about containerization, how it differs from virtual machines (system virtualization) and its benefits. Containerization and virtual machines often come up in the same breadth.

Thompson Mina
Algorithms

Number of Ordered Solution Pairs (X, Y) satisfying 1/X + 1/Y = 1/N

We have explored two insightful approaches/ algorithms to find the Number of Ordered Solution Pairs (X, Y) satisfying 1/X + 1/Y = 1/N. This problem is used extensively in Astrophysics.

Rohan Chandrashekar Rohan Chandrashekar
Rust Programming

Intro to Concurrency in Rust

So far, all of our code, all the examples and all the theories we've seen, have been ignoring one of the key features Rust aims to improve in programming. And that is of course, concurrency and parallelism. Today we're going to begin exploring these topics.

Gabriel Puiggros Gabriel Puiggros
Algorithms

Different ways to calculate Pi (3.14159...)

We have covered different algorithms and approaches to calculate the mathematical constant pi (3.14159...). These include Nilakantha Series, Leibniz’s Formula, Ramanujan's Pi Formula and other Programming Language specific techniques.

Kartik Keyan Kant Kartik Keyan Kant
Software Engineering

Mutable and Immutable in Python

In this article, we have explained the concept of Mutable and Immutable in Python and how objects are impacted with this. We have presented code examples to give an idea how it is used.

Raghu Ramjee Raghu Ramjee
Algorithms

Median of two sorted arrays

In this article, we have presented 3 Algorithms to find the Median of two sorted arrays efficiently in logarithmic time. This involves a clever use of Binary Search algorithm.

Akanksha Singh
Algorithms

Two Sum Problem: Check if pair with given sum exists [Solved]

In this article, we have explained different approaches to solve the Two Sum Problem using techniques like Binary Search, Hash Map and others.

Ue Kiao, PhD Ue Kiao, PhD
Rust Programming

Daemons in Rust

We have explored the idea of Daemons, Daemons in Rust, introduction to Cargo and crate and a Rust code example to demonstrate Daemon.

Gabriel Puiggros Gabriel Puiggros
Machine Learning (ML)

Find set of faces when combined results in face of person A

We have demonstrated a mini-project where we Find a set of faces when combined results in face of person A. We do this using Machine Learning techniques and will give you a good idea of applications of ML.

Srishti Guleria Srishti Guleria
Algorithms

Hill Climbing Algorithm

We will learn how the hill climbing algorithm works for local searching. This algorithm is a heuristic search algorithm, a concept prominently explored in areas of Artificial Intelligence (AI).

J. Varun Iyer J. Varun Iyer
Algorithms

Bin Packing problem

Bin Packing problem involves assigning n items of different weights and bins each of capacity c to a bin such that number of total used bins is minimized. It may be assumed that all items have weights smaller than bin capacity.

Rohan Chandrashekar Rohan Chandrashekar
Data Structures

Data Structure with insert and product of last K elements operations

We have presented 2 designs for Data Structure with insert and product of last K elements operations. Both operations can be done in constant time O(1).

Vikram Shishupalsingh Bais Vikram Shishupalsingh Bais
System Design

Idea Of Virtualization

We have explained in depth the idea of Virtualization in computing, what it means and how we can utilize it along with core ideas like Hypervisor.

Thompson Mina
Software Engineering

Display Live Time and Date on HTML Page

We have presented the HTML and JavaScript code to Display Live Time and Date on HTML Page. JavaScript date object and HTML span element can be used to display the current date and time. By default JavaScript use the browser's timezone to display time and date.

AASHISH
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