OpenGenus Tech Review Team - OpenGenus IQ: Learn Algorithms, DL, System Design (Page 85)

Remove K digits to make smallest number

We will be solving the problem of removing K digits from a given number to form the smallest number possible without changing the order of the original number. We will use the idea of Monotonic Stack

Algorithms

K-th Smallest element in a row and column wise sorted matrix

We have discussed how can we find the kth smallest element in a given n x n matrix, in which every row and column is sorted in non-decreasing order and covered 3 approaches: brute force, using min-heap and using Binary Search.

Algorithms

Move negative elements to front of array

This article focuses on the algorithm to move the negative elements of an array to the front. This can be solved by the two-pointer approach.

Algorithms

Number of Substrings with distinct characters

We have explored various algorithms that will help us in determining the number of substrings that a string can have with distinct characters.

Algorithms

How to approach Dynamic Programming problems? (with example)

We have explained How to approach a Dynamic Programming problem with an example. The approach depends on the constraints of the problem at hand.

Algorithms

Minimum Cut Problem [Overview]

We have covered the basics of Minimum Cut Problem, its applications like Network Reliability, algorithms like Ford-Fulkerson Algorithm to solve it and much more.

Software Engineering

Dynamic Memory Allocation in C++

Dynamic Memory Allocation in C++ is the process of allocating memory while a program is running or at run time rather than at compile time. C++ uses new and delete operator for dynamic allocation and freeing up of memory.

Problems on Binary Tree

Implement Binary Tree in Python

We have explored the strategy to implement Binary Tree in Python Programming Language with complete explanation and different operations like traversal, search and delete.

Time Complexity

Time and Space complexity of Quick Sort

We have explained the different cases like worst case, best case and average case Time Complexity (with Mathematical Analysis) and Space Complexity for Quick Sort.

Software Engineering

2D arrays in C++ (2 ways)

We have discussed what are 2 Dimensional (2D) arrays and what are the different ways we can initialize them and how we can use them in C++.

Software Engineering

[SOLVED] TypeError: only integer scalar arrays can be converted to a scalar index

Error encountered is: "TypeError: only integer scalar arrays can be converted to a scalar index". This error comes when we handle Numpy array in the wrong way using Numpy utility functions.

Algorithms

Reverse Delete Algorithm for MST

We have explored the Reverse Delete Algorithm for finding Minimum Spanning Tree (MST) along with time and space complexity, implementation and application.

Software Engineering

Struct vs Class in C++

We have covered the points of differences between struct and class in C++ with code examples. We have cleared the misconceptions about struct in C language and class in C++.

System Design

Sidecar Design Pattern in System Design

We have explored Sidecar Design Pattern in System Design along with its advantages and disadvantages and a real System Design example using Sidecar Design Pattern.

Algorithms

Types of views in Binary tree

We have explored the different types of views of the binary tree (like Left, Right, Top and Bottom View) and discussed how to find them.

Algorithms

Time and Space Complexity of Bucket Sort

We have explained the Time and Space Complexity analysis of Bucket Sort along with its algorithm, space complexity and time complexity for worst case, average case and best case.

Algorithms

Array vs Linked List [Differences Explained]

This article explain the differences between Array and Linked List (Array vs Linked List) in depth along with key points that will help you in deciding which one to use for a specific problem.

Algorithms

Number of expressions that evaluate to value K

In this problem, we have to form expressions using + and - and find the number of expressions that evaluate to K. This can be solved efficiently using Dynamic Programming and is an extension of Count Subset Problem.

Algorithms

Bit Array [Explained with example]

Bit Array is a data structures that compactly stores Boolean values or bits in the form of an array. The bits can be 0 or 1 only. Each bit in the bit array is independent.

Software Engineering

Idea of zero copy [with example]

The concept of copying data from one peripheral to another peripheral by kernel, without switching back to user-process is termed as zero copy. In this article, we have explained the concept with code examples.

Software Engineering

Passing a vector to a function in C++

In this article, we have covered how to pass a vector to a function as function argument in C++ with variants like 1D vector, 2D vector, 3D vector, global vector and global vector by value. We have also, covered how to return a vector from a function.

Algorithms

Time and Space complexity of Bubble Sort

In this article, we have explored the time and space complexity of Bubble Sort. We have covered the mathematical complexity analysis and different cases like worst case, best case, average case, space complexity and comparison with other sorting algorithms.

Algorithms

Insert element at bottom of Stack [Explained]

In this article, we have explained how to insert an element at the bottom of Stack using standard stack operations like push and pop. We have covered two approaches: iterative and recursive.

Algorithms

Median in stream of running integers [Explained 3 Algorithms]

Given that integers are being read from a data stream, we need to find the median of all the elements read so far starting from the first integer till the last integer. This is called the Median in Running stream of Integers.

System Design

Data Partitioning in System Design [Explained]

Data partitioning in simple terms is a method of distributing data across multiple tables, systems or sites to improve query processing performance and make the data more manageable. We have explored Data Partitioning in System Design in depth.