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

Software Engineering

Understanding Classes and objects in Java

You will understand Why we need classes?, How to define and use classes in Java?, Structure of classes in Java along with constructors and access specifiers, How to use objects in Java? and Characteristics and attributes of objects along with comparing two objects

Janvi Talreja
Software Engineering

Understanding and working with Third Party Cookies

In this article, you will learn what are third party cookies and how it works?, Cookie profiling, its concern and comparison of third party cookie with first party cookie and a demonstration to build your own page with a third party cookie

Isha Gautam
Software Engineering

Understanding and working with Cookies

In this article, you will understand the basic idea of cookies, different types of cookies like third party and persistent, how to set, get and delete cookies in JavaScript?, how to view cookies? and how the World looks at it? and a demo to understand the inner workings of cookies

Isha Gautam
Machine Learning (ML)

Understand Stacked Generalization (blending) in depth with code demonstration

Basic idea behind stacking is to combine the predictions of 2 or more models to get predictions of higher accuracy than the previous submodels. We demonstrate the idea using a code example

Surya Pratap Singh
Algorithms

Find the maximum sum bitonic subsequence

Given a sequence of numbers in an array A[0.......N]. Find the sum of the maximum bitonic subsequence in the array. naive algorithm will take exponential time O(N * (2^N)) but we can reduced it to O(N^2) using Dynamic programming. We will explore naive approach and go into the dynamic programming

Siddharth Agarwal Siddharth Agarwal
Data Structures

Optimizing a Segment Tree with Lazy Propagation

Lazy propagation is an optimization technique for segment tree to delay some of the update queries so that a set of update queries can be performed more efficiently together and thus, reducing the number of operations performed. The time complexity remain the same.

Siddharth Agarwal Siddharth Agarwal
Software Engineering

Web workers and its API: Run intensive tasks in the background

In some situations where javascript has to run big loops, the browser may prompt error messages. The situation explained above can be handled using Web Workers, who will do all the computationally expensive tasks without interrupting the user interface and typically run on separate threads.

Subhajit Mondal Subhajit Mondal
Software Engineering

Page Visibility API: Know when a user is on your page

it was impossible for developers to specify the code that can be executed under any case of unloading a page. In order to solve this problem, Page Visibility API was introduced. The API will listen to any visible change of the page under all the cases, regardless of that, it's on phone or desktop.

Subhajit Mondal Subhajit Mondal
Problems on Binary Tree

Algorithm for finding minimum or maximum element in Binary Search Tree【O(log V) / O(V)】

Binary Search Tree is a node-based binary tree data structure and finding the maximum or minimum element take O(log N) in average and can take O(N) in the worst case to O(1) in the best case.

Parth Maniyar Parth Maniyar
Problems on Binary Tree

Understand everything about Binary Search Tree

Binary search tree is a data structure that quickly allows us to maintain a sorted list of numbers in a tree data structure. It can be used to search for the presence of a number in O(log(n)) time and a simple traversal gives the numbers in sorted order.

Vaibhav Gupta
Problems on Binary Tree

Algorithm for finding the minimum number of swaps required to convert a binary tree to binary search tree

We developed an algorithm for finding the minimum number of swaps required to convert a binary tree to binary search tree. The Idea is do the inorder traversal of binary tree and store it in an array.Then find the minimum number of swaps require to sort an array which is the output we want.

Parth Maniyar Parth Maniyar
Algorithms

Find and print all the paths between two vertices in a graph【O((2^V)*(V+E))】

Given a directed graph, a vertex ‘v1’ and a vertex ‘v2’, print all paths from given ‘v1’ to ‘v2’. The idea is to do Depth First Traversal of given directed graph. Start the traversal from v1. Keep storing the visited vertices in an array say path[]. If we reach the vertex v2, pathExist becomes true

Parth Maniyar Parth Maniyar
Machine Learning (ML)

Image Denoising and various image processing techniques for it

We will take a look at what is an Image?, what is an Image Noise?, what are the various types of Noise?. Following it, we will understand the various traditional image processing filters and techniques used for image denoising.

Nidhi Mantri Nidhi Mantri
Machine Learning (ML)

Use of deep learning in NLP techniques

You will get an idea about What is NLP?, use of deep learning in NLP and 5 impressive applications of deep learning for NLP like image captioning

Taru Jain
Machine Learning (ML)

Applications of Autoencoders

Autoencoders are neural networks that aim to copy their inputs to outputs. The applications of autoencoders are Dimensionality Reduction, Image Compression, Image Denoising, Feature Extraction, Image generation, Sequence to sequence prediction and Recommendation system.

Nidhi Mantri Nidhi Mantri
Software Engineering

Working with device location using HTML Geolocation API

HTML Geolocation API is used to get the current position of the user. The Geolocation API is used using the navigator.geolocation object.The Geolocation interface represents an object able to programmatically obtain the position of the device.

Subhajit Mondal Subhajit Mondal
Software Engineering

Working with HTTP requests in Python

The internet is made up of a bunch of resources hosted on different servers and interact using HTTP. What is HTTP and how it works? Working with different HTTP requests in Python using the requests library Understanding the information that web resources interact with and use it programmatically

Shreya Gupta Shreya Gupta
Software Engineering

Understanding and working with Memset in C

memset is a memory utility in C which is used to set a particular value to a range of memory locations in an efficient way. On going through this article, you will understand How to use memset? and Why performance of memset is better than a simple implementation?

Bharat Arya Bharat Arya
Software Engineering

Working with Typedef in C

typedef is a keyword in C programming language,which stands for type definition. How to use typedef? Why and when to use typedef? Difference between typedef and define

Bharat Arya Bharat Arya
Software Engineering

boolean (bool or _Bool) datatype in C

C programming language (from C99) supports Boolean data type (bool) and internally, it was referred as `_Bool` as boolean was not a datatype in early versions of C. In C, boolean is known as bool data type. To use boolean, a header file stdbool.h must be included to use bool in C.

Bharat Arya Bharat Arya
Software Engineering

Working with character (char) in C

C uses char type to store characters and letters. However, the char type is integer type because underneath C stores integer numbers instead of characters. Characters supported by a computing system depends on the encoding supported by the system.

Bharat Arya Bharat Arya
Software Engineering

Reading Data from Files in Java

We will explore 5 different ways of reading files in Java BufferedReader, Scanner, StreamTokenizer, FileChannel and DataInputStream. What is the role of encodings like UTF-8 in reading data in Java? Exception/ Errors you may encounter while reading files in Java

Abhinav Prakash Abhinav Prakash
Machine Learning (ML)

Different types of Autoencoders

Autoencoder is an artificial neural network used to learn efficient data codings in an unsupervised manner. There are 7 types of autoencoders, namely, Denoising autoencoder, Sparse Autoencoder, Deep Autoencoder, Contractive Autoencoder, Undercomplete, Convolutional and Variational Autoencoder.

Abhinav Prakash Abhinav Prakash
Algorithms

Find Mother Vertex in a Graph【O(V+E)】

mother vertex in a graph is a vertex from which we can reach all the nodes in the graph through directed path. If there exist mother vertex (or vertices), then one of the mother vertices is the last finished vertex in DFS. (Or a mother vertex has the maximum finish time in DFS traversal).

Parth Maniyar Parth Maniyar
Software Engineering

Working with Clipboard API and events in HTML

The Clipboard API provides a way to hook into the common clipboard operations of cutting, copying and pasting so that web application can adjust the clipboard data as required. There are two ways we can interact with the system clipboard Document.execCommand() and asynchronous Clipboard API

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