×
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

Find minimum number of deletions to make a string palindrome

We need to find the minimum number of characters to be deleted in a string to make it a palindrome. This can be done in O(N^2) time with the help of Dynamic Programming approach of Longest Palindromic Subsequence.

Abhiram Reddy Duggempudi Abhiram Reddy Duggempudi
Data Communication and Computer Networks

Understanding Internet using ISO OSI model

In this article, we will understand how the Internet works using the ISO OSI model of networking. We will begin by understanding the ISO OSI model followed by an example.

Khitish Panigrahi Khitish Panigrahi
Software Engineering

Different ways to handle Input and Output in Java

Java handles input and output through streams and there are multiple input and output streams specialized for different use cases like BufferedOutputStream and much more which we have explored in depth in this article at OpenGenus.

ADARSH SINGH
Algorithms

Minimum insertions to make the frequency of each character unique

We developed a string algorithm to find out the minimum number of insertions to be made in a string so that the frequency of each character is unique

Shubham Kumar Shubham Kumar
Algorithms

Longest Common Subsequence

In this problem, we solved the Longest Common Subsequence problem using Dynamic Programming which takes O(N*M) time while a brute force approach takes O(2^N) time

Ashutosh Singh Ashutosh Singh
Algorithms

Longest Common Substring in two strings

In this problem, we explored a Dynamic Programming approach to find the longest common substring in two strings which is solved in O(N*M) time. Brute force takes O(N^2 * M) time.

Ashutosh Singh Ashutosh Singh
Machine Learning (ML)

Topic Modeling using Non Negative Matrix Factorization (NMF)

Non-Negative Matrix Factorization is a statistical method to reduce the dimension of the input corpora. It uses factor analysis method to provide comparatively less weightage to the words with less coherence.

Murugesh Manthiramoorthi Murugesh Manthiramoorthi
Machine Learning (ML)

Sentiment Analysis Techniques

Sentiment Analysis is the application of analyzing a text data and predict the emotion associated with it. This is a challenging Natural Language Processing problem and there are several established approaches which we will go through.

Chaitanyasuma Jain Chaitanyasuma Jain
Software Engineering

Generate all combinations taking one element from each list in Python

Generating all combinations taking one element from each list in Python can be done easily using itertools.product function. It is a part of itertools module

OpenGenus Tech Review Team OpenGenus Tech Review Team
Software Engineering

chdir(), fchdir() and getcwd() in C

chdir() and fchdir() are functions in C listed in unistd.h header file which is used to change the current working directory through code. This can be verified by getcwd() function.

Devansh Thapa Devansh Thapa
Software Engineering

Everything you need to know about Conda in Python

In this guide, we have explored everything about Conda along with a cheatsheet of commands. We have covered conda package structure and how it works internally as well.

Ramankur Goswami Ramankur Goswami
Algorithms

Evolution of Integer Multiplication Algorithms (from 1960 with end in 2019)

We started with an O(N^2) time Integer Multiplication algorithm and it was the first time ever in 1960 that we developed an faster Integer Multiplication algorithm which ran at O(N^1.58) time and now in 2019, we are nearly at the end of this domain with O(N logN) time algorithm.

OpenGenus Tech Review Team OpenGenus Tech Review Team
Algorithms

Research papers on Integer Multiplication (1960 to 2019)

hese are the papers that you should read and understand to understand how we have improved Integer Multiplication over the years and now in 2020, we are on the verge of completing this domain once for all.

OpenGenus Tech Review Team OpenGenus Tech Review Team
Machine Learning (ML)

Topic Modeling using Latent Semantic Analysis

In this article, we have explored the functioning and working of Latent Semantic Analysis with respect to topic modeling in DEPTH along with mathematics behind the method.

Murugesh Manthiramoorthi Murugesh Manthiramoorthi
Machine Learning (ML)

Residual Neural Network (ResNet)

Residual neural networks or commonly known as ResNets are the type of neural network that applies identity mapping to solve the vanishing gradient problem and perform better than RNN and CNN.

Apoorva Kandpal Apoorva Kandpal
Legends of Computer Science

Hans Peter Luhn, the man behind Hash Map

Hans Peter Luhn was a computer scientist who is famously remembered as the inventor of Hash Map and has laid the foundations of text information processing.

OpenGenus Tech Review Team OpenGenus Tech Review Team
Machine Learning (ML)

Text Summarization using RNN

Encoder Decoder RNN (Recurrent neural network) model is used in order to overcome all the limits faced by the NLP for text summarization such as getting a short and accurate summary.

Ashutosh Vashisht Ashutosh Vashisht
Algorithms

Rod cutting problem

In this article, we explored the rod cutting problem in depth which can be solved using a Dynamic Programming approach that takes O(N^2) time and O(N) space

K. Sai Drishya K. Sai Drishya
Software Engineering

push() in Stack C++ STL

We have discussed about how we can insert elements in stack container using push() method provided by C++ STL(Standard Template Library).

Gauhar Ayub Khan Gauhar Ayub Khan
Software Engineering

Authorization process of YouTube Data API

We have gone through the Authorization process of YouTube Data API and understand the use of various tokens like client secret key, authorization token, refresh token and much more

Saatwik Bisaria
Data Structures

Applications of Bloom Filter

We have explored the applications of Bloom Filter which includes weak password detection, use in Internet cache protocol, safe browsing in Google Chrome and much more.

OpenGenus Tech Review Team OpenGenus Tech Review Team
Data Structures

Bloom Filter: Better than Hash Map

Bloom Filter is a probabilistic Data Structure that is used to determine whether an element is present in a given list of elements. It is quite fast in element searching.

Harsh Bardhan Mishra Harsh Bardhan Mishra
Software Engineering

Variables in JavaScript

In this article, we will explore everything about variables in JavaScript. In JavaScript, a variable can be declared in 3 ways (var, let, const) and the variable scope depends on this.

Saksham Singh Saksham Singh
Algorithms

Volker Strassen, the man who changed Matrix Multiplication

Volker Strassen is a Computer Scientist and Mathematician who is best known as the person who broke the strongly held belief that Matrix Multiplication cannot be done faster than O(N^3) time.

OpenGenus Tech Review Team OpenGenus Tech Review Team
Machine Learning (ML)

Apriori Associative Learning Algorithm

Apriori is a associative learning algorithm which is generally used in data mining. It follows the principle that people who bought this will also buy this.

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