OpenGenus IQ: Learn Algorithms, DL, System Design (Page 88)

One-line Algorithms questions & facts

Random algorithm facts for quick interview revision when you only have a minute to spare.

DSA Cheatsheet

A Cheatsheet for data structures and algorithms practice, coding interview and problem-solving intuition.

One AI Systems Question

Practice AI and ML systems prompts across P/D disaggregation, inference, training, RAG, platform engineering and reliability.

Latest from OpenGenus

Fresh published posts

The featured cards above are quick-entry resources. Everything below is the regular post feed.

Software Engineering

ER Diagram / Entity Relationship Model

We have covered Entity Relationship Model in depth along with basics like entity, attributes, notations and much more. We have present an example of Entity Relationship Model for Job Portal database.

Algorithms

Two Sum Problem in Binary Search Tree

We have solved the Two Sum Problem in Binary Search Tree using three different approaches involving Depth First Search, Inorder Traversal and Augmented Binary Search Tree.

Culture

"Time Complexity Analysis" book

"Time Complexity Analysis" is a book focused on Mathematical Analysis of Time and Space Complexity of various algorithms and data structures along with basics of Time Complexity like Big-O notations.

Software Engineering

Software Development Lifecycles (SDLC)

We have covered the basics of Software Development Lifecycles along with the different types like Waterfall Model. We have covered advantages and different stages of SDLC.

Algorithms

Longest Common Suffix Problem

In this article, we will see how we can find the longest common suffix (i.e ending) that all the strings given to us have. We shall start with the brute-force approach for two strings. Following this, we will implement the Trie data structure to solve the problem for more than two strings.

Algorithms

Lempel Ziv Welch compression and decompression

In this article, we will learn about the Lempel Ziv Welch compression and decompression algorithm, a famous compression technique that is widely used in Unix systems and GIF format files

Machine Learning (ML)

SSD MobileNetV1 architecture

We have dived deep into what is MobileNet, what makes it special amongst other convolution neural network architectures, Single-Shot multibox Detection (SSD) how MobileNet V1 SSD came into being and its architecture.

Algorithms

Lomuto Partition Scheme

We have explained the Lomuto partition scheme, which is used in the famous Quicksort algorithm. It is an algorithm to partition an array into two parts based on a given condition.

Natural Language Processing (NLP)

Why SpaCy over NLTK?

We listed 10 aspects where spaCy shines better than NLTK. It also includes information when NLTK outsmarts spaCy.

Algorithms

Multiplication using bitwise operations

We have explained how to compute Multiplication using Bitwise Operations. We can solve this using left shift, right shift and negation bitwise operations.

Machine Learning (ML)

Boosting, an Ensemble Method

We have covered the idea of Boosting in depth along with different types of Boosting algorithms, benefits and challenges of Boosting.

Time Complexity

Basics of Time Complexity Analysis [+ notations and Complexity class]

We have explored the Basics of Time Complexity Analysis, various Time Complexity notations such as Big-O and Big-Theta, ideas of calculating and making sense of Time Complexity with a background on various complexity classes like P, NP, NP-Hard and others.

Time Complexity

Time Complexity for non-comparison based Sorting

We have explained why the minimum theoretical Time Complexity of non-comparison based sorting problem is O(N) instead of O(N logN). This is a must read. It will open up new insights.

Time Complexity

Time & Space Complexity of Binary Search [Mathematical Analysis]

We have presented the Mathematical Analysis of Time and Space Complexity of Binary Search for different cases such as Worst Case, Average Case and Best Case. We have presented the exact number of comparisons in Binary Search.

Time Complexity

Time & Space Complexity of Linear Search [Mathematical Analysis]

We have presented the Mathematical Analysis of Time and Space Complexity of Linear Search for different cases such as Worst Case, Average Case and Best Case. We have presented the exact number of comparisons in Linear Search.

Software Engineering

How to use Console in Chrome DevTools?

We have covered how to use Console which is one of the development tools in the Chrome browser. The Console in Chrome DevTool helps to debug webpages and investigate external webpage as well.

Algorithms

Probability of Collision in Hash Function [Complete Analysis]

We present the Mathematical Analysis of the Probability of Collision in a Hash Function. You will learn to calculate the expected number of collisions along with the values till which no collision will be expected and much more.

Algorithms

Inside Outside Test [2 algorithms: Even-Odd and Winding Number]

In Computer Graphics, Inside Outside is performed to test whether a given point lies inside of a closed polygon or not. Mainly, there are two methods to determine a point is interior/exterior to polygon: Even-Odd / Odd-Even Rule or Odd Parity Rule and Winding Number Method.

Algorithms

Invert / Reverse a Binary Tree [3 methods]

Inverting a binary tree is one of the most common questions asked in the interviews of many companies. In this article, we will see in detail as to how one can understand and tackle this task of inverting a binary tree using recursion, stack and queue.

Algorithms

Construct BST from pre-order traversal (using monotonic stack; no recursion)

This article discusses on a way in which, Binary Search Tree (BST) can be reconstructed when corresponding pre-order traversal of the tree is input, using a concept of monotonic stack.

Machine Learning (ML)

Architecture of DenseNet-121

We have explored the architecture of a Densely Connected CNN (DenseNet-121) and how it differs from that of a standard CNN. DenseNet-121 has 120 Convolutions and 4 AvgPool.

Algorithms

Why O(1) time complexity does not exist? + Memory Model

We have taken an in-depth look at the operations or algorithms that have a constant time in terms of asymptotic notation of time complexities. Is O(1) really a practical way of representing the time complexity of certain algorithms/ operations?

Algorithms

Reversal Algorithm to rotate an array

We have discussed Reversal algorithm. It is widely used for rotating arrays. This algorithm is specifically useful for rotating array by any number of places because it efficiently does the operation in O(N) time and O(1) auxiliary space.

Software Engineering

RPC vs REST

We have covered the differences between REST and RPC. REST stands for Representational State Transfer and RPC stands for Remote Procedural Call.

Algorithms

Deleting Duplicate Characters of String

We have explored the problem of Deleting Duplicate Characters of String such that the resulting string is lexicographically the smallest among all possibilities.