×
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 •
Algorithms

Flood Fill Algorithms

Flood Fill algorithm is an Algorithm that determines the area connected to a given node in a N-dimensional array. Some operations are performed on the connected nodes like color change. This is also known as Seed Fill Algorithm.

Piyush Agrawal Piyush Agrawal
Algorithms

Merge K sorted Linked Lists

We have explained 3 different algorithms to Merge K sorted Linked Lists such that the final Linked List is also sorted.

Akanksha Singh
Algorithms

K-th permutation of first N integers

In this article, we will understand and explore about the concept of generating k-th lexicographical permutation of first N integers. There are O(N!) permutations but you can find it in O(N) time.

Sanjana Babu
Algorithms

2 Sum Closest: Find 2 elements with sum closest to target

We have explained how to solve the 2 Sum Closest problem that is Find 2 elements with sum closest to a target efficiently. We have explained 3 different approaches which involves the use of Binary Search and Two Pointer technique.

Joe Gorst Joe Gorst
List of Interview Questions

Logical Reasoning Questions for Coding Interview

These Logical Reasoning Questions are designed for Coding Interviews at Companies hiring for Software Development or Engineering roles (Full-time + Intern). These questions are frequently asked at Amazon, Microsoft and other companies. These are usually asked in the first round of Interview.

OpenGenus Tech Review Team OpenGenus Tech Review Team
List of Interview Questions

Behavioral Questions for Coding Interviews

We have presented the most common Behavioral Questions for Coding Interviews. These are asked in the final Interview at companies like Google and Amazon for the role of SDE (full-time + Intern).

OpenGenus Tech Review Team OpenGenus Tech Review Team
Rust Programming

Ownership, Borrowing and Lifetimes in Rust

One of the key elements Rust has, which is also considered the most unique feature, is Ownership model. This allows memory safe operations without a garbage collector, and completely avoids (if using safe rust), some of the big problems other languages run into when it comes to memory management.

Gabriel Puiggros Gabriel Puiggros
C++

Different Ways to find element in Vector in C++ STL

In this article, we have explained Different Ways to find element in Vector in C++ STL which includes using std::find(), std::find_if, std::distance, std::count and Linear Search.

Erick Lumunge
Software Engineering

reCAPTCHA Verification (+ How to add it to HTML?)

In this article, we have explored the idea of reCAPTCHA Verification, how to setup a Google reCAPTCHA account and how to add reCAPTCHA to any HTML form.

AASHISH
Rust Programming

Trie Data Structure in Rust

In this article, we have presented the approach to implement Trie Data Structure in Rust Programming Language.

Gabriel Puiggros Gabriel Puiggros
Algorithms

Recovering a Binary Search Tree that has two nodes swapped

In this article, we will be developing and implementing an algorithm that recovers a Binary Search Tree (BST) that had two of its nodes swapped accidentally.

Thompson Mina
Algorithms

ZigZag Conversion of String with N rows

In this article, we have solved the problem of ZigZag Conversion of String with N rows. We take a string and a number N (rows) as input and distribute the string in ZigZag fashion among N rows and print the final string.

Joe Gorst Joe Gorst
C++

std::swap function in C++

In this article, we have explained the use of std::swap function in C++ with multiple C++ code examples covering primitive data types to User defined classes.

Shambhavi Sudarsan Shambhavi Sudarsan
Algorithms

Karger’s algorithm to find Minimum Cut

In this article, we will explore how the Karger's algorithm works to find the minimum cut in a graph and its C++ implementation. This is a randomized algorithm based on Graphs.

J. Varun Iyer J. Varun Iyer
Algorithms

Maximum points on a line

In this article, we have explored an insightful approach/ algorithm to find the maximum number of points on a straight line. This problem finds many uses in computational geometry.

Rohan Chandrashekar Rohan Chandrashekar
Software Engineering

Scope Resolution :: in C++

In this article, we have explored the idea of Scope Resolution operator :: in C++ which is used widely in C++ implementations to access a class inside another class, in multiple inheritance and many more.

Kirti Singh
Algorithms

Adjacency Matrices Explained: A Representation of Graphs

In this article, we have explained the idea of Adjacency Matrix which is good Graph Representation. We have presented it for different cases like Weighted, undirected graph along with implementation and comparison with Adjacency List.

Joe Gorst Joe Gorst
Software Engineering

Terms in CPU Scheduling: Arrival, Burst, Turnaround, Completion Time and more

This article is all about the basic terminologies in CPU Scheduling such as Arrival, Waiting, Burst, Turnaround, Completion Time and more in Simple Words and we will discuss about it in detail with a real world example.

Manikanta Nynala
C++

Size of 2D vector in C++

In this article, we will learn how to get size of 2D vector in C++. This topic has a wide applications such as in graphs, or even in machine learning. Getting used to handling 2D vectors in C++ helps us approach our problems easier.

Linh Vu
Theory of Computation

Interview Questions on Theory of Computation (MCQ)

In this article, we have present Interview Questions on Theory of Computation (MCQ). You must attempt these questions. All answers have been provided which will help you get prepared in Theory of Computation.

OpenGenus Tech Review Team OpenGenus Tech Review Team
Rust Programming

Interview Questions on Rust Programming (MCQ)

In this article, we have presented the most asked Interview Questions on Rust Programming (MCQ). You must try to answer this to judge your expertise in Rust Programming Language. All questions have been explained with answers.

OpenGenus Tech Review Team OpenGenus Tech Review Team
Algorithms

Merge two sorted linked lists

In this article, we will learn how to Merge two sorted linked list such that the final linked list is also sorted in linear time O(N).

Kartik Keyan Kant Kartik Keyan Kant
Data Structures

Scapegoat tree

In this article, we will explore in detail about Scapegoat tree which is a Self Balancing Binary Tree without requiring any extra space which puts Scapegoat Tree at an unique advantage.

Sanjana Babu
Algorithms

Longest Common Prefix

In this article, we are going to explore different approaches to find the longest common prefix between two strings. Same techniques can be applied to find the Longest Common Prefix for multiple strings.

Thompson Mina
Algorithms

4 Sum problem

In this article, we have explored an insightful approach/ algorithm to find the 4 elements in an array whose sum is equal to the required answer (4 Sum problem). This concept finds many uses in computational geometry.

Rohan Chandrashekar Rohan Chandrashekar
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