Algorithm to Compute the Maximum Nesting Depth of the Parentheses
A string is a valid parentheses string (denoted VPS) if it meets one of the following: It is an empty string “”, or a single character not equal to …
Tag: c++
Partition Equal Subset Sum Algorithms using DFS, Top-Down and Bottom-up DP
October 10, 2020
algorithms, c / c++, DFS, Dynamic Programming, dynamic programming, Knapsack Problems, math, recursive
No Comments
Given a non-empty array nums containing only positive integers, find if the array can be partitioned into two subsets such that the sum of elements in both subsets is …
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 …
Sorting and Simulation Algorithms to Compute the ATM Queue
This problem is from Google Kickstart (Round F 2020 – Kick Start 2020). There are N people numbered from 1 to N, standing in a queue to withdraw money …
O(NLogN) to Compute the Median in a Stream using Two Priority Queues
You’re given a list of n integers arr. You must compute a list output such that, for each index i (between 0 and n-1, inclusive), output is equal to …