nextcommit

Author: shashankch

src/arrays/maxProfit.java

@@ -0,0 +1,63 @@
+package arrays;
+
+import java.util.Arrays;
+import java.util.HashMap;
+
+
+public class maxProfit {
+
+    public static void profit(int arr[]) {
+
+        Arrays.sort(arr);
+        int k = 0;
+        HashMap<Integer, Integer> mp = new HashMap<>();
+        int temp[] = new int[arr.length];
+        for (int i = 0; i <= arr.length - 3; i++) {
+
+            int curr = arr[i + 1];
+            temp[k++] = curr;
+            mp.put(curr, i + 1);
+
+
+        }
+
+        // for (int i = 0; i < k; i++) {
+        //     System.out.println(temp[i]);
+        // }
+        int mx = Integer.MIN_VALUE;
+        for (int i = 0; i < k - 1; i++) {
+            
+            int curr =temp[i];
+            int index = mp.get(curr);
+
+            for (int j = i + 1; j < k; j++) {
+
+                int next = temp[j];
+                if(mp.get(next)!=index-1 && mp.get(next)!=index+1){
+                    if((curr+next)>mx){
+                        mx = (curr + next);
+                    }
+                }
+            }
+
+           
+        }
+
+
+        System.out.println("max"+mx);
+
+
+
+    }
+
+
+    public static void main(String[] args) {
+
+
+        int arr[] = {1, 2, 3, 4, 5, 6,7,8,9};
+        int arr2[] = {3, 4, 2};
+        profit(arr);
+    }
+
+
+}

src/revision/LongestBracket.java

@@ -0,0 +1,60 @@
+package revision;
+
+import java.util.HashMap;
+import java.util.Stack;
+
+public class LongestBracket {
+
+
+    public static void solution(String str) {
+        long mx = Long.MIN_VALUE;
+        HashMap<Long, Integer> mp = new HashMap<>();
+        Stack<Integer> stk = new Stack<>();
+
+        stk.push(-1);
+        for (int i = 0; i < str.length(); i++) {
+
+            if (str.charAt(i) == '(') {
+                stk.push(i);
+            }
+
+            else {
+
+
+                stk.pop();
+
+                if (!stk.isEmpty()) {
+
+                    mx = Math.max(mx, i - stk.peek());
+                    if (mp.containsKey(mx)) {
+                        mp.put(mx, mp.get(mx) + 1);
+                    } else {
+                        mp.put(mx, 1);
+                    }
+                } else {
+
+                    stk.push(i);
+                }
+
+
+
+            }
+
+
+        }
+
+        if (mx > 0) {
+
+            System.out.print(mx + " " + mp.get(mx) / 2);
+        } else {
+            System.out.print("0 1");
+        }
+    }
+
+
+
+    public static void main(String[] args) {
+
+    }
+
+}