From b71360c6680408c2bc88150dcad9c9a587bbd19c Mon Sep 17 00:00:00 2001
From: AKS1996 <sushsilsharma.ss451@gmail.com>
Date: Tue, 17 Oct 2017 23:35:25 +0530
Subject: [PATCH] Additional files similiar to TheAlgorrithms/Python

---
 Others/nested_brackets.java | 60 +++++++++++++++++++++++++++++++++++++
 Others/password_gen.java    | 39 ++++++++++++++++++++++++
 2 files changed, 99 insertions(+)
 create mode 100644 Others/nested_brackets.java
 create mode 100644 Others/password_gen.java

diff --git a/Others/nested_brackets.java b/Others/nested_brackets.java
new file mode 100644
index 000000000..000dd88b5
--- /dev/null
+++ b/Others/nested_brackets.java
@@ -0,0 +1,60 @@
+/*
+
+The nested brackets problem is a problem that determines if a sequence of
+brackets are properly nested.  A sequence of brackets s is considered properly nested
+if any of the following conditions are true:
+	- s is empty
+	- s has the form (U) or [U] or {U} where U is a properly nested string
+	- s has the form VW where V and W are properly nested strings
+For example, the string "()()[()]" is properly nested but "[(()]" is not.
+The function called is_balanced takes as input a string S which is a sequence of brackets and
+returns true if S is nested and false otherwise.
+
+	author: akshay sharma
+	date: 2017-10-17
+*/
+import java.util.Scanner;
+import java.util.Stack;
+import java.util.ArrayList;
+
+class nested_brackets {
+
+    static boolean is_balanced(char[] S) {
+        Stack<Character> stack = new Stack<>();
+        String pair = "";
+        for (int i = 0; i < S.length; ++i) {
+            if (S[i] == '(' || S[i] == '{' || S[i] == '[') {
+                stack.push(S[i]);
+            } else if (stack.size() > 0) {
+//                pair = (stack.lastElement() + S[i]);
+                if (!pair.equals("[]") && !pair.equals("()") && !pair.equals("{}")) {
+                    return false;
+                }
+            } else {
+                return false;
+            }
+        }
+
+        return stack.isEmpty();
+    }
+
+    static void print(Object a) {
+        System.out.println(a);
+    }
+
+    public static void main(String args[]) {
+        try {
+            Scanner in = new Scanner(System.in);
+            print("Enter sequence of brackets: ");
+            String S = in.nextLine();
+            if (is_balanced(S.toCharArray())) {
+                print(S + " is balanced");
+            } else {
+                print(S + " ain't balanced");
+            }
+            in.close();
+        } catch (Exception e) {
+            e.toString();
+        }
+    }
+}
diff --git a/Others/password_gen.java b/Others/password_gen.java
new file mode 100644
index 000000000..63e2a0ff6
--- /dev/null
+++ b/Others/password_gen.java
@@ -0,0 +1,39 @@
+import java.util.Collections;
+import java.util.Random;
+import java.util.List;
+import java.util.ArrayList;
+/*
+	Creates a random password from ASCII letters
+	author: akshay sharma
+	date: 2017-10-17
+*/
+class password_gen {
+public static void main(String args[]){
+        Random random = new Random();
+        List<Character> letters = new ArrayList<>();
+        for(char c:"ABCDEFGHIJKLMNOPQRSTUVWXYZ".toCharArray())
+                letters.add(c);
+
+        for(char c:"ABCDEFGHIJKLMNOPQRSTUVWXYZ".toLowerCase().toCharArray())
+                letters.add(c);
+
+        for(char c:"0123456789".toCharArray())
+                letters.add(c);
+
+        for(char c:"!@#$%^&*(){}?".toCharArray())
+                letters.add(c);
+
+
+        Collections.shuffle(letters);
+
+        int min_length = 8;
+        int max_length = 16;
+        String password = "";
+
+        for(int i= random.nextInt(max_length-min_length) + min_length; i>0; --i) {
+                password += letters.get(random.nextInt(letters.size()));
+        }
+        System.out.print("Password: " + password);
+        System.out.print("[ If you are thinking of using this passsword, You better save it. ]");
+}
+}