Added 10 solutions

voicon · Sep 11, 2017 · ba2c707 · ba2c707
1 parent 1b2f98d
commit ba2c707
Show file tree

Hide file tree

Showing 81 changed files with 517 additions and 74 deletions.
diff --git a/30 Days of Code/Day 08 - Dictionaries and Maps/Solution.java b/30 Days of Code/Day 08 - Dictionaries and Maps/Solution.java
@@ -6,7 +6,7 @@
 import java.util.HashMap;
 
 class Solution {
-    public static void main(String [] args) {
+    public static void main(String[] args) {
         /* Save input as entries in a HashMap */
         Scanner scan = new Scanner(System.in);
         int n = scan.nextInt();

diff --git a/30 Days of Code/Day 11 - 2D Arrays/Solution.java b/30 Days of Code/Day 11 - 2D Arrays/Solution.java
@@ -5,7 +5,7 @@
 import java.util.Scanner;
 
 public class Solution {
-    public static void main(String [] args) {
+    public static void main(String[] args) {
         Scanner scan = new Scanner(System.in);
         int arr[][] = new int[6][6];
         for (int row = 0; row < 6; row++) {

diff --git a/30 Days of Code/Day 13 - Abstract Classes/Solution.java b/30 Days of Code/Day 13 - Abstract Classes/Solution.java
@@ -30,7 +30,7 @@ void display() {
 }
 
 public class Solution {
-   public static void main(String [] args) {
+   public static void main(String[] args) {
       Scanner sc     = new Scanner(System.in);
       String title   = sc.nextLine();
       String author  = sc.nextLine();

diff --git a/30 Days of Code/Day 20 - Sorting/Solution.java b/30 Days of Code/Day 20 - Sorting/Solution.java
@@ -7,7 +7,7 @@
 public class Solution {
     private static int swaps = 0;
 
-    public static void main(String [] args) {
+    public static void main(String[] args) {
         /* Save input */
         Scanner scan = new Scanner(System.in);
         int size = scan.nextInt();

diff --git a/Algorithms/Bit Manipulation/Bit Manipulation - Lonely Integer/Solution.java b/Algorithms/Bit Manipulation/Bit Manipulation - Lonely Integer/Solution.java
@@ -9,7 +9,7 @@
 //   2) x ^ 0 = x
 //   3) XOR is commutative and associative
 public class Solution {
-    public static void main(String [] args) {
+    public static void main(String[] args) {
         /* Read input */
         Scanner scan = new Scanner(System.in);
         int n = scan.nextInt();

diff --git a/Algorithms/Bit Manipulation/Counter game/Solution.java b/Algorithms/Bit Manipulation/Counter game/Solution.java
@@ -38,7 +38,7 @@
 //     Number - 1 : 10110011   and the number of 1s is 5
 
 public class Solution {
-    public static void main(String [] args) {
+    public static void main(String[] args) {
         Scanner scan = new Scanner(System.in);
         int T = scan.nextInt();
         while (T-- > 0) {

diff --git a/Algorithms/Bit Manipulation/Lonely Integer/Solution.java b/Algorithms/Bit Manipulation/Lonely Integer/Solution.java
@@ -9,7 +9,7 @@
 //   2) x ^ 0 = x
 //   3) XOR is commutative and associative
 public class Solution {
-    public static void main(String [] args) {
+    public static void main(String[] args) {
         /* Save input */
         Scanner scan = new Scanner(System.in);
         int n = scan.nextInt();

diff --git a/Algorithms/Bit Manipulation/Maximizing XOR/Solution.java b/Algorithms/Bit Manipulation/Maximizing XOR/Solution.java
@@ -19,7 +19,7 @@
 // Notice that we never directly calculate the values of A and B
 
 public class Solution {
-    public static void main(String [] args) {
+    public static void main(String[] args) {
         Scanner scan = new Scanner(System.in);
         int L = scan.nextInt();
         int R = scan.nextInt();

diff --git a/Algorithms/Bit Manipulation/Sansa and XOR/Solution.java b/Algorithms/Bit Manipulation/Sansa and XOR/Solution.java
@@ -29,7 +29,7 @@
 //  Time Complexity: O(n)
 
 public class Solution {
-    public static void main(String [] args) {
+    public static void main(String[] args) {
         Scanner scan = new Scanner(System.in);
         int T = scan.nextInt();
         while (T-- > 0) {

diff --git a/Algorithms/Bit Manipulation/Sum vs XOR/Solution.java b/Algorithms/Bit Manipulation/Sum vs XOR/Solution.java
@@ -14,7 +14,7 @@
 // 2^(number of 0s) (where ^ is exponentiation in this case) to count all combinations.
 
 public class Solution {
-    public static void main(String [] args) {
+    public static void main(String[] args) {
         /* Save input */
         Scanner scan = new Scanner(System.in);
         long n = scan.nextLong();

diff --git a/Algorithms/Dynamic Programming/The Coin Change Problem/Solution.java b/Algorithms/Dynamic Programming/The Coin Change Problem/Solution.java
@@ -9,7 +9,7 @@
 // Must use "long" instead of "int" to avoid integer overflow
 
 public class Solution {
-    public static void main(String [] args) {
+    public static void main(String[] args) {
         /* Save input */
         Scanner scan = new Scanner(System.in);
         int n = scan.nextInt();

diff --git a/Algorithms/Greedy/Beautiful Pairs/Solution.java b/Algorithms/Greedy/Beautiful Pairs/Solution.java
@@ -18,7 +18,7 @@ public class Solution {
 
     private static final int MAX_NUM = 1000; // max value of any number in array
 
-    public static void main(String [] args) {
+    public static void main(String[] args) {
         Scanner scan = new Scanner(System.in);
         int N = scan.nextInt();
         int [] bucketA = new int[MAX_NUM + 1];

diff --git a/Algorithms/Search/Connected Cells in a Grid/Solution.java b/Algorithms/Search/Connected Cells in a Grid/Solution.java
@@ -13,7 +13,7 @@ public class Solution {
     private static int rows; // here for convenience
     private static int cols; // here for convenience
 
-    public static void main(String [] args) {
+    public static void main(String[] args) {
         /* Save input grid */
         Scanner scan = new Scanner(System.in);
         rows = scan.nextInt();

diff --git a/Algorithms/Search/Ice Cream Parlor/Solution.java b/Algorithms/Search/Ice Cream Parlor/Solution.java
@@ -8,7 +8,7 @@
 //  Time Complexity: O(n)
 // Space Complexity: O(n)
 public class Solution {
-    public static void main(String [] args) {
+    public static void main(String[] args) {
         Scanner scan = new Scanner(System.in);
         int t = scan.nextInt();
         while (t-- > 0) {

diff --git a/Algorithms/Sorting/Luck Balance/Solution.java b/Algorithms/Sorting/Luck Balance/Solution.java
@@ -12,7 +12,7 @@
 // Space Complexity: O(n)
 
 public class Solution {
-    public static void main(String [] args) {
+    public static void main(String[] args) {
         Scanner scan = new Scanner(System.in);
         int N = scan.nextInt();
         int K = scan.nextInt();

diff --git a/Algorithms/Sorting/Marc's Cakewalk/Solution.java b/Algorithms/Sorting/Marc's Cakewalk/Solution.java
@@ -17,7 +17,7 @@
 
 // Time Complexity: O(n log n)
 public class Solution {
-    public static void main(String [] args) {
+    public static void main(String[] args) {
         Scanner scan = new Scanner(System.in);
         int n = scan.nextInt();
         Integer [] calories = new Integer[n]; // Use Integer instead of int to make sorting in simpler

diff --git a/Algorithms/Sorting/The Full Counting Sort/Solution.java b/Algorithms/Sorting/The Full Counting Sort/Solution.java
@@ -13,7 +13,7 @@
 //     - used StringBuffer to do 1 output to console instead of multiple outputs
 
 public class Solution {
-    public static void main(String [] args) throws IOException {
+    public static void main(String[] args) throws IOException {
         final int maxValue = 100;
 
         /* Create HashMap with empty "buckets" to put Strings into */

diff --git a/Algorithms/Strings/CamelCase/Solution.java b/Algorithms/Strings/CamelCase/Solution.java
@@ -5,7 +5,7 @@
 import java.util.Scanner;
 
 public class Solution {
-    public static void main(String [] args) {
+    public static void main(String[] args) {
         Scanner scan = new Scanner(System.in);
         String str = scan.next();
         scan.close();

diff --git a/Algorithms/Strings/Gemstones/Solution.java b/Algorithms/Strings/Gemstones/Solution.java
@@ -8,7 +8,7 @@
 public class Solution {
     private static final int NUM_ELEMENTS = 26;
 
-    public static void main(String [] args) {
+    public static void main(String[] args) {
         Scanner scan = new Scanner(System.in);
         int N = scan.nextInt();
 

diff --git a/Algorithms/Strings/Mars Exploration/Solution.java b/Algorithms/Strings/Mars Exploration/Solution.java
@@ -5,7 +5,7 @@
 import java.util.Scanner;
 
 public class Solution {
-    public static void main(String [] args) {
+    public static void main(String[] args) {
         Scanner scan = new Scanner(System.in);
         String str = scan.next();
         scan.close();

diff --git a/Algorithms/Strings/Super Reduced String/Solution.java b/Algorithms/Strings/Super Reduced String/Solution.java
@@ -12,7 +12,7 @@
 // through it properly since iteration order is opposite that of a Stack.
 
 public class Solution {
-    public static void main(String [] args) {
+    public static void main(String[] args) {
         /* Save input */
         Scanner scan = new Scanner(System.in);
         String str = scan.next();

diff --git a/Algorithms/Strings/The Love-Letter Mystery/Solution.java b/Algorithms/Strings/The Love-Letter Mystery/Solution.java
@@ -9,7 +9,7 @@
 // all palindromic pairs.
 
 public class Solution {
-    public static void main(String [] args) {
+    public static void main(String[] args) {
         Scanner scan = new Scanner(System.in);
         int T = scan.nextInt();
         while (T-- > 0) {

diff --git a/Algorithms/Strings/Two Characters/Solution.java b/Algorithms/Strings/Two Characters/Solution.java
@@ -33,7 +33,7 @@ public class Solution {
 
     public static final int NUM_LETTERS = 26;
 
-    public static void main(String [] args) {
+    public static void main(String[] args) {
         /* Save input */
         Scanner scan = new Scanner(System.in);
         int length = scan.nextInt();

diff --git a/Cracking the Coding Interview/Algorithms/Binary Search - Ice Cream Parlor/Solution.java b/Cracking the Coding Interview/Algorithms/Binary Search - Ice Cream Parlor/Solution.java
@@ -8,7 +8,7 @@
 //  Time Complexity: O(n)
 // Space Complexity: O(n)
 public class Solution {
-    public static void main(String [] args) {
+    public static void main(String[] args) {
         Scanner scan = new Scanner(System.in);
         int t = scan.nextInt();
         while (t-- > 0) {

diff --git a/Cracking the Coding Interview/Algorithms/DFS - Connected Cell in a Grid/Solution.java b/Cracking the Coding Interview/Algorithms/DFS - Connected Cell in a Grid/Solution.java
@@ -13,7 +13,7 @@ public class Solution {
     private static int rows; // here for convenience
     private static int cols; // here for convenience
 
-    public static void main(String [] args) {
+    public static void main(String[] args) {
         /* Save input grid */
         Scanner scan = new Scanner(System.in);
         rows = scan.nextInt();

diff --git a/Cracking the Coding Interview/Algorithms/Merge Sort - Counting Inversions/Solution.java b/Cracking the Coding Interview/Algorithms/Merge Sort - Counting Inversions/Solution.java
@@ -12,7 +12,7 @@
 //  Time Complexity: O(n log n)
 // Space Complexity: O(n)
 public class Solution {
-    public static void main(String [] args) {
+    public static void main(String[] args) {
         Scanner scan = new Scanner(System.in);
         int testcases = scan.nextInt();
         while (testcases-- > 0) {

diff --git a/Cracking the Coding Interview/Algorithms/Sorting - Bubble Sort/Solution.java b/Cracking the Coding Interview/Algorithms/Sorting - Bubble Sort/Solution.java
@@ -7,7 +7,7 @@
 public class Solution {
     private static int swaps = 0;
 
-    public static void main(String [] args) {
+    public static void main(String[] args) {
         /* Save input */
         Scanner scan = new Scanner(System.in);
         int size = scan.nextInt();

diff --git a/Cracking the Coding Interview/Algorithms/Sorting - Comparator/Solution.java b/Cracking the Coding Interview/Algorithms/Sorting - Comparator/Solution.java
@@ -26,7 +26,7 @@ class Player {
 }
 
 class Solution {
-    public static void main(String [] args) {
+    public static void main(String[] args) {
         Scanner scan = new Scanner(System.in);
         int n = scan.nextInt();
 

diff --git a/Cracking the Coding Interview/Data Structures/Arrays - Left Rotation/Solution.java b/Cracking the Coding Interview/Data Structures/Arrays - Left Rotation/Solution.java
@@ -7,7 +7,7 @@
 //  Time Complexity: O(n)
 // Space Complexity: O(1) by doing an "in place" rotation
 public class Solution {
-    public static void main(String [] args) {
+    public static void main(String[] args) {
         /* Save input */
         Scanner scan = new Scanner(System.in);
         int size         = scan.nextInt();

diff --git a/Cracking the Coding Interview/Data Structures/Heaps - Find the Running Median/Solution.java b/Cracking the Coding Interview/Data Structures/Heaps - Find the Running Median/Solution.java
@@ -15,7 +15,7 @@ public class Solution {
     private static PriorityQueue<Integer> maxHeap = new PriorityQueue<>(Collections.reverseOrder()); // keeps track of the SMALL numbers
     private static PriorityQueue<Integer> minHeap = new PriorityQueue<>();                           // keeps track of the LARGE numbers
 
-    public static void main(String [] args) {
+    public static void main(String[] args) {
         Scanner scan = new Scanner(System.in);
         int n = scan.nextInt();
         int [] array = new int[n];

diff --git a/...the Coding Interview/Techniques, Concepts/Bit Manipulation - Lonely Integer/Solution.java b/...the Coding Interview/Techniques, Concepts/Bit Manipulation - Lonely Integer/Solution.java
@@ -9,7 +9,7 @@
 //   2) x ^ 0 = x
 //   3) XOR is commutative and associative
 public class Solution {
-    public static void main(String [] args) {
+    public static void main(String[] args) {
         /* Read input */
         Scanner scan = new Scanner(System.in);
         int n = scan.nextInt();

diff --git a/Cracking the Coding Interview/Techniques, Concepts/DP - Coin Change/Solution.java b/Cracking the Coding Interview/Techniques, Concepts/DP - Coin Change/Solution.java
@@ -9,7 +9,7 @@
 // Must use "long" instead of "int" to avoid integer overflow
 
 public class Solution {
-    public static void main(String [] args) {
+    public static void main(String[] args) {
         /* Save input */
         Scanner scan = new Scanner(System.in);
         int n = scan.nextInt();

diff --git a/...king the Coding Interview/Techniques, Concepts/Recursion - Davis' Staircase/Solution.java b/...king the Coding Interview/Techniques, Concepts/Recursion - Davis' Staircase/Solution.java
@@ -15,7 +15,7 @@
 public class Solution {
     private static HashMap<Integer, Integer> cache = new HashMap<>();
 
-    public static void main(String [] args) {
+    public static void main(String[] args) {
         Scanner scan = new Scanner(System.in);
         int testcases = scan.nextInt();
         cache.put(0, 1); // base case

diff --git a/...ing the Coding Interview/Techniques, Concepts/Recursion - Fibonacci Numbers/Solution.java b/...ing the Coding Interview/Techniques, Concepts/Recursion - Fibonacci Numbers/Solution.java
@@ -7,7 +7,7 @@
 //  Time Complexity: O(n)
 // Space Complexity: O(1)
 public class Solution {
-    public static void main(String [] args) {
+    public static void main(String[] args) {
         Scanner scan = new Scanner(System.in);
         int n = scan.nextInt();
         scan.close();

diff --git a/Cracking the Coding Interview/Techniques, Concepts/Time Complexity - Primality/Solution.java b/Cracking the Coding Interview/Techniques, Concepts/Time Complexity - Primality/Solution.java
@@ -5,7 +5,7 @@
 import java.util.Scanner;
 
 public class Solution {
-    public static void main(String [] args) {
+    public static void main(String[] args) {
         Scanner scan = new Scanner(System.in);
         int p = scan.nextInt();
         while (p-- > 0) {

diff --git a/Data Structures/Arrays/2D Array - DS/Solution.java b/Data Structures/Arrays/2D Array - DS/Solution.java
@@ -6,7 +6,7 @@
 
 public class Solution {
 
-    public static void main(String [] args) {
+    public static void main(String[] args) {
         Scanner scan = new Scanner(System.in);
         int arr[][] = new int[6][6];
         for (int row = 0; row < 6; row++) {

diff --git a/Data Structures/Arrays/Algorithmic Crush/Solution.java b/Data Structures/Arrays/Algorithmic Crush/Solution.java
@@ -17,7 +17,7 @@
 //  Time Complexity: O(n + m)
 // Space Complexity: O(n)
 public class Solution {
-    public static void main(String [] args) {
+    public static void main(String[] args) {
         Scanner scan = new Scanner(System.in);
         int N = scan.nextInt();
         int M = scan.nextInt();

diff --git a/Data Structures/Arrays/Arrays - DS/Solution.java b/Data Structures/Arrays/Arrays - DS/Solution.java
@@ -5,7 +5,7 @@
 import java.util.Scanner;
 
 public class Solution {
-    public static void main(String [] args) {
+    public static void main(String[] args) {
         /* Save input */
         Scanner scan = new Scanner(System.in);
         int size = scan.nextInt();

diff --git a/Data Structures/Arrays/Left Rotation/Solution.java b/Data Structures/Arrays/Left Rotation/Solution.java
@@ -7,7 +7,7 @@
 //  Time Complexity: O(n)
 // Space Complexity: O(1) by doing an "in place" rotation
 public class Solution {
-    public static void main(String [] args) {
+    public static void main(String[] args) {
         /* Save input */
         Scanner scan = new Scanner(System.in);
         int size         = scan.nextInt();

diff --git a/Data Structures/Heaps/Find the Running Median/Solution.java b/Data Structures/Heaps/Find the Running Median/Solution.java
@@ -15,7 +15,7 @@ public class Solution {
     private static PriorityQueue<Integer> maxHeap = new PriorityQueue<>(Collections.reverseOrder()); // keeps track of the SMALL numbers
     private static PriorityQueue<Integer> minHeap = new PriorityQueue<>();                           // keeps track of the LARGE numbers
 
-    public static void main(String [] args) {
+    public static void main(String[] args) {
         Scanner scan = new Scanner(System.in);
         int n = scan.nextInt();
         int [] array = new int[n];

diff --git a/Data Structures/Trees/Square-Ten Tree/Solution.java b/Data Structures/Trees/Square-Ten Tree/Solution.java
@@ -16,7 +16,7 @@
 // - To achieve linear runtime, we need an algorithm that splits up these giant numbers into portions and processes them separately. A great way to do this is to split by level, as done below.
 // - This was a very difficult problem. You must have both linear runtime and efficient code to pass all testcases.
 public class Solution {
-    public static void main(String [] args) {
+    public static void main(String[] args) {
         /* Read and save input */
         Scanner scan = new Scanner(System.in);
         String strL  = new BigInt(scan.next()).subtract(BigInt.ONE).toString(); // subtract 1 since it's [L,R] inclusive

diff --git a/Data Structures/Trees/Swap Nodes [Algo]/Solution.java b/Data Structures/Trees/Swap Nodes [Algo]/Solution.java
@@ -7,7 +7,7 @@
 // Main trick: Repesent our tree as a 1-D array
 
 public class Solution {
-    public static void main(String [] args) {
+    public static void main(String[] args) {
         /* Create tree */
         Scanner scan = new Scanner(System.in);
         int N = scan.nextInt();

diff --git a/Data Structures/Trees/Tree - Height of a Binary Tree/Solution.java b/Data Structures/Trees/Tree - Height of a Binary Tree/Solution.java
@@ -42,7 +42,7 @@ public static Node insert(Node root, int data) {
             return root;
         }
     }
-    public static void main(String [] args) {
+    public static void main(String[] args) {
         Scanner scan = new Scanner(System.in);
         int t = scan.nextInt();
         Node root = null;

diff --git a/General Programming/Basic Programming/A Very Big Sum/Solution.java b/General Programming/Basic Programming/A Very Big Sum/Solution.java
@@ -5,7 +5,7 @@
 import java.util.Scanner;
 
 public class Solution {
-    public static void main(String [] args) {
+    public static void main(String[] args) {
         Scanner scan = new Scanner(System.in);
         int size = scan.nextInt();
         long sum = 0; // use long to prevent integer overflow