[LeetCode] Optimal Division

553. Optimal Division

You are given an integer array nums. The adjacent integers in nums will perform the float division.

  • For example, for nums = [2,3,4], we will evaluate the expression “2/3/4”.

However, you can add any number of parenthesis at any position to change the priority of operations. You want to add these parentheses such the value of the expression after the evaluation is maximum.

Return the corresponding expression that has the maximum value in string format.

Note: your expression should not contain redundant parenthesis.

Read more
[AtCoder] E - Takahashi`s AnguishRead more
[AtCoder] D - Union of IntervalRead more
[AtCoder] E - Graph DestructionRead more
[AtCoder] D - Longest XRead more
[AtCoder] B - Colorful LinesRead more
[Codeforces] Global Round 6 C. Diverse MatrixRead more
[Codeforces] Good Bye 2019 C. Make GoodRead more
[Codeforces] Round #606 (Div. 1, based on Technocup 2020 Elimination Round 4) A. As Simple as One and TwoRead more
[Codeforces] Educational Round 79 (Rated for Div. 2) C. Stack of PresentsRead more