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

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
Algorithms

Convert one string to another by changing all occurrence of a character to another

We will be solving Check if one string can be converted to another by changing all occurrence of a character to another character problem using the Union and Find algorithm.

Raghavendra Achar C
Machine Learning (ML)

Back Propagation (Intuitively)

Back Propagation is one of the most important topics of Neural Net Training. It is the process of tuning the weights of neural network and is based on the rate of error of previous epoch.

Srishti Guleria Srishti Guleria
Software Engineering

3D Vectors in C++

Article for 3D Vector in C++ which contains guide for creating 3D vector, adding elements, deleting elements traversing through vector and different ways for doing these.

Vikram Shishupalsingh Bais Vikram Shishupalsingh Bais
Algorithms

Maximum XOR of two numbers in an array using Trie

Given a list of numbers we need to identify a pair of numbers in the list such that the XOR of those numbers is the maximum possible over all the pairs.

Rohit Topi
Algorithms

Find k-th smallest element using QuickSelect algorithm

Quickselect is an approach where we use divide and conquer and find the k th smallest element in an average O(N) time.

Rohit Topi
Algorithms

Longest Alternating Subsequence

Given an array, find the length of the longest alternating subsequence. We solve this using two approaches: Dynamic Programming and Efficient Approach.

Aditya Kumar Saroj
Data Structures

Applications of Binary Tree

Binary Tree is the most used Tree Data Structure and is used in real life Software systems. We have listed applications of Binary Tree and its variants.

Ue Kiao, PhD Ue Kiao, PhD
Software Engineering

Programmatic TableView using Swift

In this article, we are going to see how to create a table view in swift code without using visual designer.

Sai Balaji
Software Engineering

Building programmatic UI using Swift

Learn to build programmatic UI in Swift UIKit without using StoryBoard.

Sai Balaji
Software Engineering

Upgrade Insecure Requests

The “upgrade-insecure-requests” Content Security Policy header instructs your browser request web stuff and do it with HTTPS and not HTTP.

Mikhail Zhivoderov Mikhail Zhivoderov
Algorithms

Find length of the longest Fibonacci subsequence

We have a strictly increasing array of positive integers. Our task is to find the length of the longest Fibonacci subsequence possible. We will solve this using Brute force and Dynamic Programming.

Raghavendra Achar C
Algorithms

Next Larger / Smaller element in Array (using Monotonic Queue)

In this problem, we are given an array and our task is to find the next larger/ smaller element for each element in the array. We have covered brute force approach and Monotonic Queue.

Raghavendra Achar C
String Algorithms

Minimum number of operations to convert binary string to self-destructing

We will explore algorithms to find the Minimum number of operations to convert a binary string to a self-destructing string.

Aditya Kumar Saroj
Software Engineering

JSON Parsing in iOS using Swift

Learn how to make HTTP GET request in Swift and Parse JSON Response.

Sai Balaji
Algorithms

Basics of stable matching

We have covered the basics of Stable Matching and algorithms associated with it like Gale Shapley Algorithm, Irving's Algorithm, Hospital Residents Problems and more.

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