Question: Sigmoid | Recent Online Assessment 2025 | Sell Gold Optimization Problem | Latest Sigmoid Placement Questions | Maximize Profit with Kth Day Multipliers
0
Entering edit mode

Question 1: Sell Gold

Problem Statement:

You have N ornaments made of gold placed in a row. You have been given an array of N positive integers representing the base price of each ornament. Every day, you choose to sell either the leftmost or the rightmost gold ornament.

If you sell an ornament on the Kth day, its price becomes K times its base price. Your task is to find and return an integer value representing the maximum amount you can earn by selling all of these gold ornaments.

Note: You sell exactly one gold ornament each day.

Input Specification:

  • input1: An integer value N representing the number of gold ornaments.
  • input2: An integer array of size N representing the base price of each ornament.
ADD COMMENTlink 1 day ago Rohit • 20

Login before adding your answer.

Similar Posts
Loading Similar Posts