optimized array solution

src/main/java/Solution.java

@@ -1,5 +1,4 @@
 import java.util.*;
-import java.util.stream.*;
 
 class Solution {
 	
@@ -10,14 +9,16 @@ class Solution {
 				.toArray();
 		
 		// code your solution here
-		var maxProfit = IntStream.range( 0, prices.length )
+		int maxProfit = 0;
-				.map( index -> {
+		for ( int index = 0; index < prices.length; index++ ) {
-					var range = Arrays.copyOfRange( prices, index, prices.length );
+			var currentPrice = prices[index];
-					var max = IntStream.of( range ).max().orElse( 0 );
+			
-					// difference between current price and future maximum
+			for ( int rem = index + 1; rem < prices.length; rem++ ) {
-					return max - prices[index];
+				var futurePrice = prices[rem];
-				})
+				var profit = futurePrice - currentPrice;
-				.max().orElse( 0 );
+				maxProfit = Math.max( profit, maxProfit );
+			}
+		}
 		
 		// Write result with System.out.println()
 		System.out.println( maxProfit );