Featured Resource One-line Algorithms questions & facts Random algorithm facts for quick interview revision when you only have a minute to spare.
Book DSA Cheatsheet A Cheatsheet for data structures and algorithms practice, coding interview and problem-solving intuition.
Featured Resource One AI Systems Question Practice AI and ML systems prompts across P/D disaggregation, inference, training, RAG, platform engineering and reliability.
Linux Build teXinfo from source In this article, we have presented the steps to get the source code/ release package of teXinfo and build it from source and install in your system.
String Algorithms N-th Permutation of a string Given a string of length of `m` containing only lowercase alphabets. Find out the lexicographic `nth` permutation of the given string.
System Design Apache HBase in System Design In this article, we will learn when Apache HBase might be a good choice of database for your software. Since HBase is a NoSQL database, we begin by exploring the design choice between choosing SQL or NoSQL databases for your application.
Algorithms Complete Binary Tree In this article, we will learn about the what is the tree, Binary tree and complete binary tree also how it differs from a general Binary Tree in terms of different operations.
Data Communication and Computer Networks Switching Modes in Computer Networks In this article at OpenGenus, we will be discussing about the various switching modes in a Computer Network. But before we do that let us first understand what a switch is in detail.
Computer Architecture SIMD & SSE Instruction Set In this article, we will discuss scalar computing (and some of its drawbacks), the need for vector/parallel computing, the fundamental concepts behind single instruction, multiple data (or SIMD) architecture and SSE.
Java Introduction to Spring Boot In this article, we explore one of the most popular Frameworks for Java Developers - Spring Boot and compare it with other popular frameworks like Spring, Spring MVC, Hibernate, and Spring Data.
String Algorithms Lexicographic next string In this article, we are going to find the lexicographic next string for the given string.
Algorithms Preorder traversal in Binary Tree [Iterative + Recursive] Preorder traversal is one of the traversal in binary tree in which the root node is visited first then the left subtree and then the right subtree. The order can be written as ROOT LEFT RIGHT.
Data Communication and Computer Networks Different types of Firewall Before we learn about the different types of a firewall, we should first understand what is a firewall? Back in the day when the Internet was first created, we did not need anything like firewalls.
data science AO* algorithm AO* algorithm is a best first search algorithm. AO* algorithm uses the concept of AND-OR graphs to decompose any complex problem given into smaller set of problems which are further solved.
Natural Language Processing (NLP) Types of NLP models Natural Language Processing (NLP) refers to a branch of Artificial Intelligence (AI) in Computer Science that gives computers the ability to analyze and interpret human language.
Machine Learning (ML) Contrastive Learning Contrastive learning is a method for structuring the work of locating similarities and differences for an ML model. This method can be used to train a machine learning model to distinguish between similar and different photos.
hardware AVX-512 In this article, we will discuss Intel's Advanced Vector Extensions 512 (AVX-512), which is an instruction set that was created to accelerate computational performance in areas such as artificial intelligence/deep learning.
Time Complexity Time and Space Complexity of Merge Sort on Linked List In this article, we will learn about the space and time complexity of the Merge sort algorithm on Linked List using Mathematical analysis of various cases.
Algorithms Add digits of a number [Algorithm + Time Complexity] In this article, we have explained the algorithm to add digits of a number N and presented the time and space complexity analysis. We have present an implementation in C Programming Language as well.
Algorithms First K maximum occurring words In this article, we will understand the different approaches to return the first k maximum occurring words from a given array. It includes core Data Structures and Algorithm topics such as Arrays, HashMap, Sorting, Priority Queue and Heap, Trie, and Bucket sort.
String Algorithms Check if a string can be convert to another by swapping two characters Having two strings s1 and s2 equal in length of size n, you must check if they are equal after you swap any of two different characters. If strings are different on more than just 2 characters it must return false.
System Design Object-Oriented Database This article aims to explain the object-oriented database and its principles, contrast the object-oriented database with the relational database and provide examples of object-oriented database management systems.
trie Find word with maximum frequency using Trie In this article, we will design an algorithm to Find word with maximum frequency using Trie Data Structure.
data science F Test F-tests get their name from the F test statistic, which was named after Sir Ronald Fisher. The F-statistic is just a two-variance ratio. Variances are a metric for dispersion, or how far the data deviates from the mean. Greater dispersion is shown by higher values.
System Design Who uses Apache Kafka and why? In the last few years, Apache Kafka has become one of the most popular open-source streaming platforms. From startups to large enterprises, many organizations use Kafka for its high throughput and low latency capabilities.
Machine Learning (ML) Posenet Model in ML In this article, we will learn about pre-trained model PoseNet in detail which will be consisting of need and working of posenet, operations possible on it, its application, and possible improvement over existing posenet model.
Machine Learning (ML) Transposed Convolution Transposed convolution is also known as upsampled convolution, which refers to the task it accomplishes, which is to upsample the input feature map.
Algorithms Bottom up traversal of Trie In this article, we have explained the algorithmic approach for Bottom up traversal of Trie.