We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Search
  4. Minimum Loss
  5. Discussions

Minimum Loss

  • kirill78zah
     + 0 comments

    I think the best way to solve it is to use a BST. Sadly, there's no suitable built-in BST in C# which is my favorite coding language. So, I solved it in C++.

    int minimumLoss(std::vector<long> price) {
	std::set<long> before;
	long minLoss = LONG_MAX;
	for (long p : price)
	{
		long nearestGreater = *before.upper_bound(p);
		long loss = nearestGreater - p;
		if (loss > 0 && loss < minLoss)
			minLoss = loss;

		before.insert(p);
	}

	return minLoss;
}