Depth First Search Algorithm to Check If Two Expression Trees are Equivalent
A binary expression tree is a kind of binary tree used to represent arithmetic expressions. Each node of a binary expression tree has either zero or two children. Leaf …
Tag: unordered_map
Prefix Sum Algorithm to Count Number of Nice Subarrays
Given an array of integers nums and an integer k. A subarray is called nice if there are k odd numbers on it. Return the number of nice sub-arrays. …
How to Find the Longest Harmonious Subsequence?
We define a harmounious array as an array where the difference between its maximum value and its minimum value is exactly 1. Now, given an integer array, you need …
How to Compute the Projection Area of 3D Shapes?
On a N * N grid, we place some 1 * 1 * 1 cubes that are axis-aligned with the x, y, and z axes. Each value v = …
How to Check if Two Strings are Isomorphic?
Two strings are isomorphic if the characters in one string can be replaced to get another one. No two characters may map to the same character. A character can …
