×
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 •
Software Engineering

Fixed width integer types (int8) in C++

C99 has defined a set of fixed-width integers that are guaranteed to have the same size on any architecture. These can be found in stdint.h header. This enables to use INT8 in C++.

Aditya Kumar Saroj
Algorithms

Finding 2 elements with difference k in a sorted array

This article discusses how to check the existence of and find 2 elements with difference k in sorted array. We have explored 3 approaches and solved it in linear time O(N).

Varul Srivastava
Algorithms

Minimum number of nodes to be removed such that no subtree has more than K nodes

The article contains editorial + implementation for Finding minimum number of nodes to be removed such that no sub tree has more than K nodes.

Vikram Shishupalsingh Bais Vikram Shishupalsingh Bais
Algorithms

Number of substrings with exactly k distinct characters

In this problem, we are given a string and our job is to count the total number of substrings of the given string that contains exactly k distinct characters. We have explored 3 approaches to solve this.

Raghavendra Achar C
Algorithms

Different ways to sort a Queue

We will be discussing 4 different ways to sort a queue. This involves sorting a Queue using auxiliary array, O(1) space, using recursion and using a stack.

Tushti
Software Engineering

endl vs \n (New Line) in C++

In C++, endl and /n are used to break lines or move the cursor to a new line. Both endl and \n may seem to be similar but has distinct differences which we have explored in this article in depth.

Shreya Shah Shreya Shah
Software Engineering

Regular Expression (Regex) in Python

We have explained Regex in Python in depth. Everyone has used the feature of CTRL+F to find some text in documents, Regex also known as Regular Expression is advance form of that it allows the user to search for a pattern defined by him/her in the given set of input.

Ansh Agrawal Ansh Agrawal
Algorithms

Implementing two stacks in one array

We will demonstrate how to implement 2 stacks in one array. Both stacks are independent but use the same array. We need to make sure one stack does not interfere with the other stack and support push and pop operation accordingly.

Prnika Bakshi Prnika Bakshi
Algorithms

Reverse first K elements of Queue using Stack

To reverse the first K elements of a queue, we can use an auxiliary stack. We push the first k elements in the stack and pop() them out so and add them at the end of the queue.

Tushti
Algorithms

Time Complexity of Insertion Sort

The average code and worst case time complexity of Insertion Sort is O(N^2) and the best case time complexity is O(N). The space complexity is O(N) for N elements.

Shweta Bhardwaj
Software Engineering

Set vs Map containers in C++

This article is to discuss the difference between a set and a map which are both containers in the Standard Template Library in C++.

Siddhant Rao
Software Engineering

How to phish? or Phishing Campaigns

We have explored the basic idea behind Phishing and different types like Email Phishing, Spear, Clone, Page and Web Page Phishing.

Mikhail Zhivoderov Mikhail Zhivoderov
Algorithms

Intersection point of two linked lists

Given two linked lists, where the tail of the second list points to a node in the first list, find the node where both the lists intersect. We need to find the intersection point.

Akshay Atam
Software Engineering

Different ways to insert elements in Deque in C++

We have explored different ways to insert elements in Deque in C++ such as deque::push_back(), insert(), assign(), emplace(), swap() and much more.

Suryansh Gautam
Software Engineering

Flask API using Flask RestFul

We will be developing a flask API using flask restful in which we will be performing all the basic CRUD operations.

Dipto Chakrabarty Dipto Chakrabarty
Algorithms

Column Sort Algorithm

Column Sort Algorithm is a non-traditional sorting algorithm for Distributed Memory Clusters (DMC) (means multiple processors). It is a generalization of odd-even merge sort and is used in a parralel system where multiple CPUs are available for use.

Varul Srivastava
Algorithms

Shift OR algorithm for String Matching

Shift OR algorithm uses bitwise techniques to check whether the given pattern is present in the string or not. It is efficient if the pattern length is lesser than the memory-word size of the machine

Raghavendra Achar C
Software Engineering

Uploading files to FireBase storage from iOS apps

In this article, we have illustrated how to upload files to FireBase cloud storage from iOS app.

Sai Balaji
Software Engineering

Using strings and characters in C++ safely

Secure Coding in C++ or why we have to use strings and characters in C++ safely? What is C++, what are Strings and Buffer Overflows? And something about software vulnerabilities and exploits

Mikhail Zhivoderov Mikhail Zhivoderov
System Design

System Design of Online Coding Judge (Competitive Programming Platform)

In this article, we have explored the system design of an online coding judge like HackerRank and CodeForces in depth and explored the best choices.

Sushma Narayan Hegde
System Design

Memory Pool with C++ Implementation

Memory Pool is an optimization technique of allocating a specific amount of memory beforehand and handle all allocation and deallocation of memory from a concerned software system from this pre-allocated memory (which is known as Memory Pool).

Benjamin QoChuk, PhD Benjamin QoChuk, PhD
Algorithms

Move the first element of the linked list to the end

In this problem, given a linked list, we move the first element of the linked list to the end of the linked list.

Harshita Kanal
Problems on Binary Tree

Construct Binary Tree from Inorder and Preorder traversal

We present two approaches to Construct Binary Tree from Inorder and Preorder traversal. We start with background information on constructing Binary Tree from a given traversal or a set of traversals.

Srishti Guleria Srishti Guleria
Software Engineering

Different ways to initialize an array in C++

We have covered Different ways to initialize an array in C++ including both the standard array and array container in STL.

Vasu Soni Vasu Soni
Algorithms

Variants of Stable Marriage Problem

We have explored the variants of stable marriage problem like Egalitarian Stable Matching, Minimum Regret Stable Matching, Stable marriage with ties, Stable marriage with incomplete lists and others.

Tushti
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