Search results
May 13, 2021 · In this HackerRank Equal Stacks problem, we have three stacks of cylinders where each cylinder has the same diameter, but they may vary in height. you can change the height of a stack by removing and discarding its topmost cylinder any number of times. we need to find the maximum possible height of the stacks such that all of the stacks are ...
You have three stacks of cylinders where each cylinder has the same diameter, but they may vary in height. You can change the height of a stack by removing and discarding its topmost cylinder any number of times.
Find the maximum possible height of the stacks such that all of the stacks are exactly the same height. This means you must remove zero or more cylinders from the top of zero or more of the three stacks until they are all the same height, then return the height.
Sep 29, 2020 · Question: Given 3 arrays, where each element represent the height of a cylinder. Find the maximum possible height of equal stacks by removing one or more cylinders from the original stack. Example: Input: n1 [] = {3, 2, 1, 1, 1} n2 [] = {4, 3, 2} n3 [] = {1, 1, 4, 1}
Oct 26, 2020 · Equal Stacks is a programming challenge on HackerRank that uses the stack data structure. You need to balance out 3 stacks such that they have the maximum height. Watch the video to...
vector < int > set_stack_sums (const vector < int >& vec) {vector < int > sum; sum. reserve (vec. size ()); int curr_sum = 0; for (int i = vec. size ()-1; i >= 0;--i) {curr_sum += vec [i]; sum. push_back (curr_sum);} return sum;} int equalStacks (vector < int > h1, vector < int > h2, vector < int > h3) {if (h1. empty || h2. empty || h3. empty ...
HackerRank concepts & solutions. Contribute to BlakeBrown/HackerRank-Solutions development by creating an account on GitHub.
