×
Home Discussions Write at Opengenus IQ
×
  • #7daysOfCode
  • C Interview questions
  • Linux 💽
  • 🔊 Data Structures
  • Graph Algorithms
  • Dynamic Programming 💑
  • Greedy Algo 📔
  • Algo Book 🧠
  • String Algo 🧬
  • Join our Internship 🎓
  • Home

Independent and Organic community to explore various insightful Computing Ideas. We do not sell courses :|

Algorithms

Minimum steps to make binary string empty by removing alternating subsequence in each step

Given a string str consisting of only '0's and '1's, the task is to make the string empty by performing minimum number of operations. An operation is defined as the removal of an alternating subsequence from str without changing the order of the remaining characters.

Aditya Kumar Saroj
Software Engineering

Digit Separators in C++

In this article, we have discussed about Digit Separators in C++. This topic is introduced in C++14. Using digit separators in the code make it easy for human readers to parse large numeric values.

Ketaki Gorakshanath Gangadhar
Algorithms

Minimum elements to be removed from array to make the sum even

Given an array of integer and you have to find minimum no of integers or elements from array need to be removed so that sum of all elements of array results an even value.

Aayushi Ghadiya
Software Engineering

Algorithm behind Bill splitting app

Ever wondered how Bill Splitting app works? We have explained the graph algorithms used in its design in depth. So let's find out how can we resolve this dependency issue. Which data structure will hit your brain at the first time?

Yusuf Vanwala
Software Engineering

System Design of File Uploading Service

We have discussed things we're supposed to keep in mind while designing a web-based file uploading service, handling and restricting the number of uploads by the user, how to handle version history in the database, and efficiently come up with a design.

Pulkit Sharma
Algorithms

Heavy Light Decomposition of tree

Heavy Light Decomposition, a competitive programming algorithm is very useful in solving queries efficiently. We will see its usecase, implementation and finally solve few problems based on it.

Rashmitha
Data Structures

Soft heap

Soft heap is a variant of heap data structure (priority queue). It is a powerful data structure owing to amortized constant time complexity of some basic functions.

Tushti
Software Engineering

Basics of CSS (Cascading Style Sheets)

We have covered the basics of CSS in depth. Cascading Style Sheets (CSS) is a style sheet language which is used for designing the webpages and their layouts developed in a markup language like HTML.

Tejan Singh Tejan Singh
Algorithms

Longest Decreasing Subsequence using Dynamic Programming

In this problem (Longest Decreasing Subsequence), you are given an array of length N. You have to find the longest decreasing subsequence (LDS) from the given array. We have solved this using Dynamic Programming.

Shubham Sood Shubham Sood
Algorithms

Longest Common Decreasing Subsequence

In this problem (Longest Common Decreasing Subsequence), we are given 2 arrays and we need to find out the longest common decreasing subsequence from those two arrays. This can be solved using Dynamic Programming.

Amruta U. Koshe
Algorithms

Maximum Sum Increasing Subsequence

In this problem (Maximum Sum Increasing Subsequence), we are given an array and we need to find out the maximum sum increasing subsequence from that array. This can be solved using Dynamic Programming.

Amruta U. Koshe
Data Structures

Augmented Data Structures

Augmenting a data structure (or Augmented Data Structure) means using a existing data structure and making some changes in that data structure to fit our needs. We have explained the idea of augmented data structure with examples.

Hrithik Shrivastava
Machine Learning (ML)

Multilayer Perceptron

Multilayer perceptron is a fundamental concept in Machine Learning (ML) that lead to the first successful ML model, Artificial Neural Network (ANN). We have explored the idea of Multilayer Perceptron in depth.

Ayush Mehar
Machine Learning (ML)

Multilayer Perceptrons vs CNN

We have explored the key differences between Multilayer perceptron and CNN in depth. Multilayer Perceptron and CNN are two fundamental concepts in Machine Learning. When we apply activations to Multilayer perceptrons, we get Artificial Neural Network (ANN) which is one of the earliest ML models.

Ayush Mehar
Machine Learning (ML)

Disadvantages of RNN

We have explored the disadvantages of RNN in depth. Recurrent Neural Networks (or RNNs) are the first of their kind neural networks that can help in analyzing and learning sequences of data rather than just instance-based learning.

Dishant Parikh
Machine Learning (ML)

BERT base vs BERT large

BERT base model has 12 encoder layers stacked on top of each other whereas BERT large has 24 layers of encoders stacked on top of each other.

Zuhaib Akhtar
Algorithms

Different Basic Sorting algorithms. Know when to use which one and Ace your tech interview!

We have covered the basic ideas of the basic sorting algorithms such as Insertion Sort and others along with time and space complexity and Interview questions on sorting algorithms with answers.

Sushma Narayan Hegde
Software Engineering

Different ways to center elements in HTML

In this article, we have discussed Different ways to center elements in HTML. Firstly we'll discuss on the Introduction to the article. Later part, we'll understand ways of centering elements of HTML elements - Horizontally, in-line with other elements and at exact center.

Shiva Basava P
Machine Learning (ML)

Applications of NLP: Extraction from PDF, Language Translation and more

In this, we have explored core NLP applications such as text extraction, language translation, text classification, question answering, text to speech, speech to text and more.

Shubham Sood Shubham Sood
Machine Learning (ML)

Applications of NLP: Text Generation, Text Summarization and Sentiment Analysis

In this article, we have explored 3 core NLP applications such as Text Generation using GPT models, Text summarization and Sentiment Analysis.

Shubham Sood Shubham Sood
Algorithms

Designing a Binary Search Tree with no NULLs

A Binary Search Tree (BST) is usually implemented using NULLs in C or C++. This article explores an alternative approach of using placeholder nodes. Here the Binary Search Tree will be implemented in C++.

Rohit Topi
Data Structures

Optimizations in Union Find Data Structure

Union find data structure is also called disjoined set data structure as it a collection of disjoined subsets. There are different optimizations such as union by rank/ size, path compression and much more.

Anjali Chaturvedi Anjali Chaturvedi
Software Engineering

Basics Of React JS

React is a JavaScript library used for building the user interfaces or single page apps. We have explained the basic concepts of React JS in depth.

Devansh Chaubey Devansh Chaubey
Software Engineering

Sending Browser Notifications from Chrome Extensions

In this article, we have explored how to send browser notifications from Chrome extensions. We have explained the process step by step.

Harshita Kanal
Software Engineering

Implementing rmdir using C/ C++

We have developed the rmdir command of UNIX systems in C and C++ by using the remove and nftw system functions to delete a directory.

Sahil Silare Sahil Silare
×

Visit our discussion forum to ask any question and join our community

View Forum
OpenGenus IQ © 2021 All rights reserved â„¢ [email: team@opengenus.org]
Top Posts LinkedIn Twitter