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

Software Engineering

Learn to use For loop in Kotlin

For loop is a commonly used type of loop that is supported in Kotlin and we will learn about it in this article.

Thura Htue Ko Ko
Software Engineering

Learn about While and Do While loops in Kotlin

While and Do While are two types of loops that are supported in Kotlin and we will learn about them in this article.

Thura Htue Ko Ko
Software Engineering

Learn about While loop in Python

While loop statement in Python programming language repeatedly executes a target statement as long as a given condition is true.

Drishti singh
Software Engineering

Master the use of Constructors in Java

In Java, a constructor is a block of code similar to a method which is used to initialize objects. It is called when an instance of a class is created.

Ananyashree
Software Engineering

Using CSS to print an HTML webpage nicely

You will learn ow to use CSS to make printing a webpage convenient? along with features like adding page break, hiding particular part from printing and others, How to block an user from printing a webpage? and a demonstration to clarify the ideas involved

Isha Gautam
Problems on Binary Tree

Sum of k smallest elements in Binary Search Tree

Given a binary search tree and a integer k our task is to find out sum of all the elements which is less or equal to the k th smallest element

Parth Maniyar Parth Maniyar
Problems on Binary Tree

Find k-th smallest element in Binary Search Tree

Given root of the tree and k as input, output K th smallest element. We reduce the time complexity from O(N) to O(log N).

Parth Maniyar Parth Maniyar
Problems on Binary Tree

Algorithm to convert Binary Search Tree into Balanced Binary Search Tree

In this article, we will explore an algorithm to convert a Binary Search Tree (BST) into a Balanced Binary Search Tree in linear time O(N).

Parth Maniyar Parth Maniyar
Machine Learning (ML)

Data Analysis using Regression

In this article, we have clarified the most usually utilized kinds of regressions in information science and its application in data analysis

priyansh gupta priyansh gupta
Machine Learning (ML)

Using Histogram of Oriented Gradients (HOG) for Object Detection

Principle behind histogram of oriented gradients is that local object appearance and shape within an image can be described by the distribution of intensity gradients or edge directions and hence, can be used for object detection

Eklavya Chopra
Machine Learning (ML)

Learn about various Object Detection Techniques

We will understand what is object detection, why we need to do object detection and the basic idea behind various techniques used to solved this problem. We start with the basic techniques like Viola Jones face detector to some of the advanced techniques like Single Shot Detector.

Eklavya Chopra
Software Engineering

Creating a Very Simple Web API in Node.JS

In this article, we will explore how to build a simple API in Node.JS. We will cover the basics of an API before going into the implementation details.

Priyanka Yadav Priyanka Yadav
Software Engineering

Work with Routing in Node.js

In this article, we will take a look at how routing works in Node.js and set up different routes with combinations of pathname and query to test our idea.

Priyanka Yadav Priyanka Yadav
Software Engineering

Create a simple Web Server using Node.js

In this tutorial, we will a simple web server in Node.js and run it locally on our machine listening to a port. It will response with a text data and HTTP headers.

Priyanka Yadav Priyanka Yadav
Software Engineering

Introduction to Modules in Node.js

In this article, we will go through the three types of modules in Node.js namely in-built, third party and local modules and explore them with examples.

Priyanka Yadav Priyanka Yadav
Software Engineering

Introduction to Node.js

In this article, we will take you through the basic idea of NodeJS and its package manager NPM, Installation guide and a basic example with When to use it

Priyanka Yadav Priyanka Yadav
Machine Learning (ML)

Build and use an Image Denoising Autoencoder model in Keras

In this article, we will see How encoder and decoder part of autoencoder are reverse of each other? and How can we remove noise from image, i.e. Image denoising, using autoencoder? in Keras

Nidhi Mantri Nidhi Mantri
Software Engineering

Build an HTML form to insert data in a database in PHP MySQLi

In this article, we are going to see how a form is made and how the details entered by the user are stored in a database. We will use PHP and MySQL

Raghav Virmani Raghav Virmani
Problems on Binary Tree

Copy a binary tree where each node has a random pointer

We explored an algorithm to copy a binary tree with an additional pointer which points to any random node in the tree. We explored two techniques Naive solution using 2 traversals and Efficient solution using hashing.

Akshay Gopani Akshay Gopani
Algorithms

Find Maximum Subarray Sum using divide and conquer

We are interested in to find maximum subarray sum (contiguous) of given 1-D array. Array may contain negative and positive numbers which makes this a difficult problem. Brute force will take O(N^2) time while a divide and conquer approach will take O(N log N) time.

Akshay Gopani Akshay Gopani
Algorithms

Converting Postfix to Infix using Stack

We have explored an algorithm to convert a Postfix expression to Infix expression using Stack. This takes linear time O(N)

Akshay Gopani Akshay Gopani
Data Structures

Count inversions in an array using Fenwick Tree

Fenwick tree is usually used for range query problems but it can be used to solve the problem of finding the number of inversions in an array efficiently.

Akshay Gopani Akshay Gopani
Data Structures

Understanding Fenwick tree (Binary Indexed Tree) with Range product

Fenwick tree is a tree based data structure that is widely used to solve range query problems in logarithmic time O(log N) which would otherwise have taken linear time O(N). In this article, we have explained it in depth using the range product query problem.

Akshay Gopani Akshay Gopani
Software Engineering

Start using Local Storage in JavaScript in Browser

Local storage is a key value storage such that you can store a data as a set of size 2 such as {key, value}. To get the value back, we need to pass key, then we get back value.

Siddharth Gusain Siddharth Gusain
Software Engineering

Work with files on the web using FileReader API in JavaScript

FileReader object helps in reading data from a file or a Blob and store it in a JavaScript variable. The read is done asynchronously so as not to block the browser.

Yash Kumar Yash Kumar
OpenGenus IQ © 2026 All rights reserved â„¢ [email: team@opengenus.org]
Top Posts LinkedIn Twitter