Merge pull request #25 from lxmn22nov/branch-lxmn2

Java: Sorting 2

Author: akscoder082003

Java/Sorting/BuyTwoChocolates.java

@@ -0,0 +1,19 @@
+/*
+ * PROBLEM: 2706: Buy Two Chocolates
+ */
+public class BuyTwoChocolates {
+    public int buyChoco(int[] prices, int money) {
+        int cheapestChocolate = Math.min(prices[0], prices[1]);
+        int secondCheapestChocolate = Math.max(prices[0], prices[1]);
+        for (int i = 2; i < prices.length; i++) {
+            if (prices[i] < cheapestChocolate) {
+                secondCheapestChocolate = cheapestChocolate;
+                cheapestChocolate = prices[i];
+            } else if (prices[i] < secondCheapestChocolate) {
+                secondCheapestChocolate = prices[i];
+            }
+        }
+        int totalCost = cheapestChocolate + secondCheapestChocolate;
+        return totalCost <= money ? (money - totalCost) : money;
+    }
+}

Java/String/RemoveOutermostParentheses.java

@@ -1,22 +0,0 @@
-public String removeOuterParentheses(String S) {
-    Stack<Character> stack = new Stack<>();
-    StringBuilder sb = new StringBuilder();
-    for (int i = 0; i < S.length(); i++) {
-        char c = S.charAt(i);
-        if (stack.isEmpty() && c == '(') {
-            stack.push(c);
-            continue;
-        }
-        if (stack.size() == 1 && c == ')') {
-            stack.pop();
-            continue;
-        }
-        if (c == '(') {
-            stack.push(c);
-        } else {
-            stack.pop();
-        }
-        sb.append(c);
-    }
-    return sb.toString();
-}