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

Maximal Rectangle problem (using Monotonic queue)

We have solved the maximal rectangle problem using Monotonic queue. In this problem we are given a matrix consisting of only 0's and 1's, we need to find the largest rectangle consisting of only 1's and return its area.

Algorithms

Monotonic Queue (with Daily Temperatures & Largest Rectangle in Histogram)

Monotonic queue is a data structure where the data is entirely in non-decreasing order or entirely in non-increasing order. It is generally used for optimizing dynamic programming techniques.

Algorithms

Reverse a Stack

The objective of this article is to explore various approaches that can be used to reverse the given stack (stack is a linear data structure where insertion and deletion are made at the same end).

Machine Learning (ML)

Stacking in Machine Learning

Stacking (a.k.a Stack Generalization) is an ensemble technique that uses meta-learning for generating predictions. We have explained stacking in Machine Learning (ML) in depth.

Software Engineering

Control Flow statements in Ruby

Control flow statements are used for the controlled logical and conditional execution of a statement. We have explored Control Flow statements in Ruby in depth.

Algorithms

Zig Zag Traversal of Binary Tree

In this article, we present 4 different approaches for Zig Zag Traversal of Binary Tree using stack, deque, recursion and an iterative approach.

Algorithms

Check if 2 Binary Trees are isomorphic

Two Binary Trees are known as isomorphic if one of them can be obtained from the other one by series of flipping of nodes, swapping the children both left and right of number of nodes.

Algorithms

Convert Binary Tree to Circular Doubly Linked list

To convert binary tree to circular doubly linked list, we will take left node as previous pointer and right node as next pointer. The order of nodes in Doubly Linked List must be same as in inorder of the given binary tree.

Algorithms

Succinct (0-1) Encoding of Binary Tree

Succinct (0-1) Encoding of Binary Tree is an approach to encode a Binary Tree to the lowest possible space and maintain the structural information.

Algorithms

LCA in Binary Tree using Euler tour and Range Minimum Query

In this problem, we will find the Lowest Common Ancestor of a Binary Tree using Euler tour and Range Minimum Query. We can solve the LCA problem by reducing it to a RMQ problem.

Algorithms

Lowest Common Ancestor in a Binary Tree

In binary trees, for given two nodes a and b, the lowest common ancestor is the node of which both a and b are descendants. We explored the algorithm to find Lowest Common Ancestor in a Binary Tree.

Problems on Binary Tree

Operations in Threaded Binary Tree

There are three main operations which can be done on a threaded binary tree Insert, Search and Delete operation which we have explained in depth.

Problems on Binary Tree

Threaded Binary Tree

Threaded binary tree is a simple binary tree but they have a speciality that null pointers of leaf node of the binary tree is set to inorder predecessor or inorder successor.

Algorithms

Boolean Parenthesization Problem

We will solve Boolean Parenthesization Problem using Dynamic Programming and understand the algorithm with a step by step explanation. The time complexity to solve this problem is O(N^3) with a space complexity of O(N^2).

Algorithms

Delete Middle Node from Linked List

In this problem, we will delete the Middle Node from a given Linked List. We have covered the algorithm (along with implementation) to delete the middle node from a Singly Linked List and Doubly Linked List.

Problems on Binary Tree

Checking if a Binary Tree is foldable

A binary tree is foldable if the left subtree and right subtree are mirror images of each other. An empty tree is also foldable. We have presented two algorithms to check if Binary Tree is foldable.

Problems on Binary Tree

Serialization and Deserialization of Binary Tree

We have presented the process of Serialization and Deserialization of Binary Tree where we convert a Binary Tree into a compress form which can be saved in a file and retrieved back.

Problems on Binary Tree

Convert a Binary Tree to a Skewed Binary Tree

We have presented the algorithm to Change a Binary Tree to a Skewed Binary Tree (both Increasing Skewed Binary Tree and Decreasing Skewed Binary Tree).

Problems on Binary Tree

Check if a Binary Tree is skewed or not

We have presented the algorithm to check if a given Binary Tree is skewed or not (can be left or right skewed Binary Tree).

Problems on Binary Tree

Introduction to Skewed Binary Tree

A binary tree can be called a skewed binary tree if all nodes have one child or no child at all. There are two types: left and right skewed.

Software Engineering

Basics of Unordered multiset in C++

An unordered multiset is an unordered set (a set in which a key can be stored in any random order) that allows different elements to have equivalent values (allows duplicate items).

Software Engineering

Basic commands for using VIM editor like a Pro

In this guide, we have presented all basic commands that you will need to use VIM editor for doing all tasks efficiently. You will learn how to search for a word, how to replace the word, select, copy, paste, using various special features of VIM and much more.

Algorithms

Munchausen Number

A number that is equal to the sum of its digits each raised to the power equal to its digit is a Munchausen Number or perfect digit-to-digit invariant(PDDI).

Culture

Bram Moolenaar: Man behind VIM has several failed projects

Bram Moolenaar is an iconic Software Programmer from Netherlands who developed VIM editor, the alternative to VI editor on UNIX systems. He is the most prominent Open Source Software Developer from Netherlands.

Culture

Riku Kawasaki

Riku Kawasaki is a Competitive Programmer from Japan and is notable from reaching the World Rank 2 on CodeForces (as on March 2021) and being an Algorithmic Finalist at Topcoder Open 2019.