×
Home Discussions Write at Opengenus IQ
×

Search anything:

  • DSA Cheatsheet
  • HOME
  • Jobs
  • About
  • One Liner
  • RANDOM
  • Track your progress
  • Deep Learning (FREE)
  • Join our Internship 🎓
  • AI Engineering
  • Scholarship
  • Campus Ambassador

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

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
Algorithms

Implementing Priority Queue using Linked List

We demonstrated the approach to Implement a Priority Queue using Linked List and support all operations like push and pop efficiently.

Vikranth R Gaddam Vikranth R Gaddam
Software Engineering

Bit header file in C++20

Bit header was included in the C++20. This header provides components such as types and functions to access, manipulate and process individual bits and bit sequences.

Rohit Topi
System Design

System design of an URL Shortener (TinyURL or Bit.ly)

We have explained the ideas involved to design a system for URL shortening service which is scalable in the real environment.

Pulkit Sharma
System Design

Design of Rate Limiting System

We have explained how to Design a Rate Limiting System in a scalable way and explored various algorithms that are used in practice.

Sushma Narayan Hegde
Software Engineering

Introduction to Cocoa Pods

Learn about Cocoa Pods and how to use them in your projects to speed up the development time

Sai Balaji
Software Engineering

Email Password Authentication using FireBase in iOS App

Learn how to add email, password authentication to your iOS apps without building any dedicated backend service

Sai Balaji
Software Engineering

TreeSet in Java

TreeSet is created using the implementations of the SortedSet interface in Java and it uses Tree for storage.

Shashank Gautam
Problems on Binary Tree

Level order traversal of a Binary Tree

In this article, we have explored Level order traversal of a Binary Tree in depth using two approaches: recursive approach and queue.

Akshay Atam
Algorithms

Coin Change Problem

Coin change problem is very similar to unbounded knapsack problem which can be solved easily and efficiently by using Dynamic Programming. General task is to find maximum number of ways to add the coins from the array for given amount.

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