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 index 5bed875..74016ff 100644 --- 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.Scanner; 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 index 3a023f0..c27252c 100644 --- 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 index 6f999fe..2bdc379 100644 --- 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 @@ class MyBook extends Book { } 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 index f94580e..2a57479 100644 --- a/30 Days of Code/Day 20 - Sorting/Solution.java +++ b/30 Days of Code/Day 20 - Sorting/Solution.java @@ -7,7 +7,7 @@ import java.util.Scanner; 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 index 73fd2ea..5cf6ff9 100644 --- a/Algorithms/Bit Manipulation/Bit Manipulation - Lonely Integer/Solution.java +++ b/Algorithms/Bit Manipulation/Bit Manipulation - Lonely Integer/Solution.java @@ -9,7 +9,7 @@ import java.util.Scanner; // 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 index 7a5e234..5779900 100644 --- a/Algorithms/Bit Manipulation/Counter game/Solution.java +++ b/Algorithms/Bit Manipulation/Counter game/Solution.java @@ -38,7 +38,7 @@ import java.math.BigInteger; // 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 index 485c057..00effd8 100644 --- a/Algorithms/Bit Manipulation/Lonely Integer/Solution.java +++ b/Algorithms/Bit Manipulation/Lonely Integer/Solution.java @@ -9,7 +9,7 @@ import java.util.Scanner; // 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 index 15613ac..b00d6ea 100644 --- a/Algorithms/Bit Manipulation/Maximizing XOR/Solution.java +++ b/Algorithms/Bit Manipulation/Maximizing XOR/Solution.java @@ -19,7 +19,7 @@ import java.util.Scanner; // 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 index e2824b0..478dc0c 100644 --- a/Algorithms/Bit Manipulation/Sansa and XOR/Solution.java +++ b/Algorithms/Bit Manipulation/Sansa and XOR/Solution.java @@ -29,7 +29,7 @@ import java.util.Scanner; // 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 index 390e06b..ffc44de 100644 --- a/Algorithms/Bit Manipulation/Sum vs XOR/Solution.java +++ b/Algorithms/Bit Manipulation/Sum vs XOR/Solution.java @@ -14,7 +14,7 @@ import java.util.Scanner; // 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 index 7c4f3de..d41e79d 100644 --- a/Algorithms/Dynamic Programming/The Coin Change Problem/Solution.java +++ b/Algorithms/Dynamic Programming/The Coin Change Problem/Solution.java @@ -9,7 +9,7 @@ import java.util.HashMap; // 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 index 7fdc3ba..40e26d7 100644 --- 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 index b5fd3e9..bcc77a3 100644 --- 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 index 2c9f293..ca2d53f 100644 --- a/Algorithms/Search/Ice Cream Parlor/Solution.java +++ b/Algorithms/Search/Ice Cream Parlor/Solution.java @@ -8,7 +8,7 @@ import java.util.HashMap; // 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 index 68ae803..37183e4 100644 --- a/Algorithms/Sorting/Luck Balance/Solution.java +++ b/Algorithms/Sorting/Luck Balance/Solution.java @@ -12,7 +12,7 @@ import java.util.ArrayList; // 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 index 4a0e795..6663868 100644 --- a/Algorithms/Sorting/Marc's Cakewalk/Solution.java +++ b/Algorithms/Sorting/Marc's Cakewalk/Solution.java @@ -17,7 +17,7 @@ import java.util.Collections; // 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 index 2e36e84..8b1dc4c 100644 --- a/Algorithms/Sorting/The Full Counting Sort/Solution.java +++ b/Algorithms/Sorting/The Full Counting Sort/Solution.java @@ -13,7 +13,7 @@ import java.util.ArrayList; // - 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 index 3b5cf80..cf2128b 100644 --- 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 index d30f025..d4f78a0 100644 --- a/Algorithms/Strings/Gemstones/Solution.java +++ b/Algorithms/Strings/Gemstones/Solution.java @@ -8,7 +8,7 @@ import java.util.BitSet; 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 index 22144be..b141f91 100644 --- 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 index ba67f35..c23982a 100644 --- a/Algorithms/Strings/Super Reduced String/Solution.java +++ b/Algorithms/Strings/Super Reduced String/Solution.java @@ -12,7 +12,7 @@ import java.util.Stack; // 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 index b1499f7..bc95804 100644 --- a/Algorithms/Strings/The Love-Letter Mystery/Solution.java +++ b/Algorithms/Strings/The Love-Letter Mystery/Solution.java @@ -9,7 +9,7 @@ import java.util.Scanner; // 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 index 797af86..a027573 100644 --- 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 index 2c9f293..ca2d53f 100644 --- 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 @@ import java.util.HashMap; // 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 index b5fd3e9..bcc77a3 100644 --- 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 index 7e7e74e..02f4824 100644 --- 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 @@ import java.util.Arrays; // 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 index f94580e..2a57479 100644 --- 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 @@ import java.util.Scanner; 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 index 97b8c06..494b867 100644 --- 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 index 12cbbfa..be05a45 100644 --- 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 @@ import java.util.Scanner; // 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 index 560a304..e7d81c7 100644 --- 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 maxHeap = new PriorityQueue<>(Collections.reverseOrder()); // keeps track of the SMALL numbers private static PriorityQueue 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/Cracking the Coding Interview/Techniques, Concepts/Bit Manipulation - Lonely Integer/Solution.java b/Cracking the Coding Interview/Techniques, Concepts/Bit Manipulation - Lonely Integer/Solution.java index 73fd2ea..5cf6ff9 100644 --- a/Cracking the Coding Interview/Techniques, Concepts/Bit Manipulation - Lonely Integer/Solution.java +++ b/Cracking the Coding Interview/Techniques, Concepts/Bit Manipulation - Lonely Integer/Solution.java @@ -9,7 +9,7 @@ import java.util.Scanner; // 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 index 7c4f3de..d41e79d 100644 --- 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 @@ import java.util.HashMap; // 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/Cracking the Coding Interview/Techniques, Concepts/Recursion - Davis' Staircase/Solution.java b/Cracking the Coding Interview/Techniques, Concepts/Recursion - Davis' Staircase/Solution.java index b108484..dc6b814 100644 --- a/Cracking the Coding Interview/Techniques, Concepts/Recursion - Davis' Staircase/Solution.java +++ b/Cracking the Coding Interview/Techniques, Concepts/Recursion - Davis' Staircase/Solution.java @@ -15,7 +15,7 @@ import java.util.HashMap; public class Solution { private static HashMap 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/Cracking the Coding Interview/Techniques, Concepts/Recursion - Fibonacci Numbers/Solution.java b/Cracking the Coding Interview/Techniques, Concepts/Recursion - Fibonacci Numbers/Solution.java index a5c4a0b..f7f125a 100644 --- a/Cracking the Coding Interview/Techniques, Concepts/Recursion - Fibonacci Numbers/Solution.java +++ b/Cracking the Coding Interview/Techniques, Concepts/Recursion - Fibonacci Numbers/Solution.java @@ -7,7 +7,7 @@ import java.util.Scanner; // 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 index 41413f2..3eac536 100644 --- 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 index 645294a..5844b7b 100644 --- a/Data Structures/Arrays/2D Array - DS/Solution.java +++ b/Data Structures/Arrays/2D Array - DS/Solution.java @@ -6,7 +6,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/Data Structures/Arrays/Algorithmic Crush/Solution.java b/Data Structures/Arrays/Algorithmic Crush/Solution.java index b0b9b61..9385055 100644 --- a/Data Structures/Arrays/Algorithmic Crush/Solution.java +++ b/Data Structures/Arrays/Algorithmic Crush/Solution.java @@ -17,7 +17,7 @@ import java.util.Scanner; // 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 index 097d44b..deaadde 100644 --- 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 index 12cbbfa..be05a45 100644 --- a/Data Structures/Arrays/Left Rotation/Solution.java +++ b/Data Structures/Arrays/Left Rotation/Solution.java @@ -7,7 +7,7 @@ import java.util.Scanner; // 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 index 560a304..e7d81c7 100644 --- 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 maxHeap = new PriorityQueue<>(Collections.reverseOrder()); // keeps track of the SMALL numbers private static PriorityQueue 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 index 1a62731..736f4c7 100644 --- a/Data Structures/Trees/Square-Ten Tree/Solution.java +++ b/Data Structures/Trees/Square-Ten Tree/Solution.java @@ -16,7 +16,7 @@ import java.util.Arrays; // - 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 index 1b3de05..2a9e8ee 100644 --- a/Data Structures/Trees/Swap Nodes [Algo]/Solution.java +++ b/Data Structures/Trees/Swap Nodes [Algo]/Solution.java @@ -7,7 +7,7 @@ import java.util.Scanner; // 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 index ec30b9c..f973ee5 100644 --- 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 @@ class Solution { 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 index bc105ed..847b2fe 100644 --- 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 diff --git a/General Programming/Basic Programming/Append and Delete/Solution.java b/General Programming/Basic Programming/Append and Delete/Solution.java index 0767294..acc8c3f 100644 --- a/General Programming/Basic Programming/Append and Delete/Solution.java +++ b/General Programming/Basic Programming/Append and Delete/Solution.java @@ -14,7 +14,7 @@ import java.util.Scanner; // and a delete. public class Solution { - public static void main(String [] args) { + public static void main(String[] args) { Scanner scan = new Scanner(System.in); String s = scan.next(); String t = scan.next(); diff --git a/General Programming/Basic Programming/Apple and Orange/Solution.java b/General Programming/Basic Programming/Apple and Orange/Solution.java index 851967d..03353ab 100644 --- a/General Programming/Basic Programming/Apple and Orange/Solution.java +++ b/General Programming/Basic Programming/Apple and Orange/Solution.java @@ -7,7 +7,7 @@ import java.util.Scanner; // Time Complexity: O(m + n) // Space Complexity: O(1) public class Solution { - public static void main(String [] args) { + public static void main(String[] args) { /* Save input */ Scanner scan = new Scanner(System.in); int s = scan.nextInt(); diff --git a/General Programming/Basic Programming/Beautiful Days at the Movies/Solution.java b/General Programming/Basic Programming/Beautiful Days at the Movies/Solution.java index 1c29d0d..1dfd37f 100644 --- a/General Programming/Basic Programming/Beautiful Days at the Movies/Solution.java +++ b/General Programming/Basic Programming/Beautiful Days at the Movies/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 i = scan.nextInt(); int j = scan.nextInt(); diff --git a/General Programming/Basic Programming/Between Two Sets/Solution.java b/General Programming/Basic Programming/Between Two Sets/Solution.java index 3bccf1b..139189c 100644 --- a/General Programming/Basic Programming/Between Two Sets/Solution.java +++ b/General Programming/Basic Programming/Between Two Sets/Solution.java @@ -6,7 +6,7 @@ import java.util.Scanner; import java.util.Arrays; 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/General Programming/Basic Programming/Birthday Cake Candles/Solution.java b/General Programming/Basic Programming/Birthday Cake Candles/Solution.java new file mode 100644 index 0000000..f5de5f6 --- /dev/null +++ b/General Programming/Basic Programming/Birthday Cake Candles/Solution.java @@ -0,0 +1,42 @@ +// Author: Rodney Shaghoulian +// Github: github.com/rshaghoulian +// HackerRank: hackerrank.com/rshaghoulian + +import java.util.Scanner; +import java.util.Arrays; + +// Time Complexity: O(n) +// Space Complexity: O(n) to save the input. +// You can reduce the space complexity to O(1) by omitting the array and +// working with the input directly, but it will make the code less modular + +public class Solution { + static int cakeCandles(int[] candles) { + int tallest = 0; + int count = 0; + for (int candle : candles) { + if (candle > tallest) { + tallest = candle; + count = 1; + } else if (tallest == candle) { + count++; + } + } + return count; + } + + public static void main(String[] args) { + /* Save input */ + Scanner scan = new Scanner(System.in); + int n = scan.nextInt(); + int[] candles = new int[n]; + for (int i = 0; i < n; i++) { + candles[i] = scan.nextInt(); + } + scan.close(); + + /* Get num candles blown out */ + int result = cakeCandles(candles); + System.out.println(result); + } +} diff --git a/General Programming/Basic Programming/Birthday Chocolate/Solution.java b/General Programming/Basic Programming/Birthday Chocolate/Solution.java new file mode 100644 index 0000000..eb04c7a --- /dev/null +++ b/General Programming/Basic Programming/Birthday Chocolate/Solution.java @@ -0,0 +1,52 @@ +// Author: Rodney Shaghoulian +// Github: github.com/rshaghoulian +// HackerRank: hackerrank.com/rshaghoulian + +import java.util.Scanner; + +// Idea: Use a "sliding window" of "m" squares. Each time we add a square to the right, remove one from the left. + +// Time Complexity: O(n) +// Space Complexity: O(1) (other than saving input) +public class Solution { + static int solve(int n, int[] square, int d, int m) { + int sum = 0; + int numWays = 0; + + /* Test first set of "m" chocolates */ + for (int i = 0; i < m; i++) { + sum += square[i]; + } + if (sum == d) { + numWays++; + } + + /* Test remaining sets of "m" chocolates */ + for (int i = m; i < square.length; i++) { + sum += square[i] - square[i-m]; // add chocolate, remove chocolate + if (sum == d) { + numWays++; + } + } + + return numWays; + } + + public static void main(String[] args) { + /* Save input */ + Scanner scan = new Scanner(System.in); + int n = scan.nextInt(); + int[] square = new int[n]; + for (int i = 0; i < n; i++) { + square[i] = scan.nextInt(); + } + int d = scan.nextInt(); + int m = scan.nextInt(); + scan.close(); + + /* Calculate result */ + int result = solve(n, square, d, m); + System.out.println(result); + } +} + diff --git a/General Programming/Basic Programming/Breaking the Records/Solution.java b/General Programming/Basic Programming/Breaking the Records/Solution.java new file mode 100644 index 0000000..e642139 --- /dev/null +++ b/General Programming/Basic Programming/Breaking the Records/Solution.java @@ -0,0 +1,40 @@ +// Author: Rodney Shaghoulian +// Github: github.com/rshaghoulian +// HackerRank: hackerrank.com/rshaghoulian + +import java.util.Scanner; + +// Time complexity: O(n) +public class Solution { + public static void main(String[] args) { + /* Save input */ + Scanner scan = new Scanner(System.in); + int n = scan.nextInt(); + int[] scores = new int[n]; + for (int i = 0; i < n; i++) { + scores[i] = scan.nextInt(); + } + scan.close(); + + /* Calculate answer */ + printRecords(scores); + } + + static void printRecords(int[] scores){ + int min = scores[0]; + int max = scores[0]; + int higherScore = 0; + int lowerScore = 0; + for (int score: scores) { + if (score > max) { + max = score; + higherScore++; + } + if (score < min) { + min = score; + lowerScore++; + } + } + System.out.print(higherScore + " " + lowerScore); + } +} diff --git a/General Programming/Basic Programming/Cats and a Mouse/Solution.java b/General Programming/Basic Programming/Cats and a Mouse/Solution.java new file mode 100644 index 0000000..a62431f --- /dev/null +++ b/General Programming/Basic Programming/Cats and a Mouse/Solution.java @@ -0,0 +1,31 @@ +// Author: Rodney Shaghoulian +// Github: github.com/rshaghoulian +// HackerRank: hackerrank.com/rshaghoulian + +import java.util.Scanner; + +public class Solution { + public static void main(String[] args) { + Scanner scan = new Scanner(System.in); + int q = scan.nextInt(); + while (q-- > 0) { + int x = scan.nextInt(); + int y = scan.nextInt(); + int z = scan.nextInt(); + System.out.println(solve(x, y, z)); + } + scan.close(); + } + + private static String solve(int x, int y, int z) { + int A_to_C = Math.abs(z - x); + int B_to_C = Math.abs(z - y); + if (A_to_C < B_to_C) { + return "Cat A"; + } else if (A_to_C > B_to_C) { + return "Cat B"; + } else { + return "Mouse C"; + } + } +} diff --git a/General Programming/Basic Programming/Climbing the Leaderboard/Solution.java b/General Programming/Basic Programming/Climbing the Leaderboard/Solution.java new file mode 100644 index 0000000..f56f190 --- /dev/null +++ b/General Programming/Basic Programming/Climbing the Leaderboard/Solution.java @@ -0,0 +1,47 @@ +// Author: Rodney Shaghoulian +// Github: github.com/rshaghoulian +// HackerRank: hackerrank.com/rshaghoulian + +import java.util.Scanner; + +// Time Complexity: O(n + m) +// Space Complexity: O(1) (other than storing input) +public class Solution { + public static void main(String[] args) { + /* Save input - discard duplicates in leaderboard */ + Scanner scan = new Scanner(System.in); + int n = scan.nextInt(); + int lastScore = -1; + int[] scores = new int[n]; + int index = 0; + while (n-- > 0) { + int currScore = scan.nextInt(); + if (currScore != lastScore) { + scores[index] = currScore; + index++; + } + lastScore = currScore; + } + int m = scan.nextInt(); + int[] alice = new int[m]; + for (int i = 0; i < m; i++) { + alice[i] = scan.nextInt(); + } + scan.close(); + + /* Print ranks */ + int i = index - 1; + for (int aliceScore : alice) { + while (i >= 0) { + if (aliceScore < scores[i]) { + System.out.println(i + 2); // add 2 to get correct rank + break; + } + i--; + } + if (i < 0) { // if true, each remaining aliceScore is highest score + System.out.println(1); + } + } + } +} diff --git a/General Programming/Basic Programming/Compare the Triplets/Solution.java b/General Programming/Basic Programming/Compare the Triplets/Solution.java index a69c396..642f26a 100644 --- a/General Programming/Basic Programming/Compare the Triplets/Solution.java +++ b/General Programming/Basic Programming/Compare the Triplets/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 a0 = scan.nextInt(); int a1 = scan.nextInt(); diff --git a/General Programming/Basic Programming/Counting Valleys/Solution.java b/General Programming/Basic Programming/Counting Valleys/Solution.java new file mode 100644 index 0000000..0478371 --- /dev/null +++ b/General Programming/Basic Programming/Counting Valleys/Solution.java @@ -0,0 +1,38 @@ +// Author: Rodney Shaghoulian +// Github: github.com/rshaghoulian +// HackerRank: hackerrank.com/rshaghoulian + +import java.util.Scanner; + +// Idea: Keep track of your "level", which is how far above or below sea level you are. +// If you ever take a step up to sea level, you just completed walking through a valley. + +// Time Complexity: O(n) +public class Solution { + public static void main(String[] args) { + /* Save input */ + Scanner scan = new Scanner(System.in); + scan.nextLine(); // gets rid of 1st line + String str = scan.nextLine(); // String is of size "n" + scan.close(); + + System.out.println(countValleys(str)); + } + + private static int countValleys(String str) { + int level = 0; + int numValleys = 0; + for (int i = 0; i < str.length(); i++) { + char ch = str.charAt(i); + if (ch == 'U') { + level++; + if (level == 0) { + numValleys++; // since we just stepped up to sea level + } + } else if (ch == 'D') { + level--; + } + } + return numValleys; + } +} diff --git a/General Programming/Basic Programming/Designer PDF Viewer/Solution.java b/General Programming/Basic Programming/Designer PDF Viewer/Solution.java index e9cc943..d53f1d6 100644 --- a/General Programming/Basic Programming/Designer PDF Viewer/Solution.java +++ b/General Programming/Basic Programming/Designer PDF Viewer/Solution.java @@ -8,7 +8,7 @@ public class Solution { private static final int letters = 26; - public static void main(String [] args) { + public static void main(String[] args) { /* Save input */ Scanner scan = new Scanner(System.in); int [] height = new int[letters]; diff --git a/General Programming/Basic Programming/Divisible Sum Pairs/Solution.java b/General Programming/Basic Programming/Divisible Sum Pairs/Solution.java index b6c96d4..31ad4a9 100644 --- a/General Programming/Basic Programming/Divisible Sum Pairs/Solution.java +++ b/General Programming/Basic Programming/Divisible Sum Pairs/Solution.java @@ -32,7 +32,7 @@ this complement bucket can be paired with our original number to create a sum di 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 n = scan.nextInt(); int k = scan.nextInt(); diff --git a/General Programming/Basic Programming/Drawing Book/Solution.java b/General Programming/Basic Programming/Drawing Book/Solution.java new file mode 100644 index 0000000..8f3171a --- /dev/null +++ b/General Programming/Basic Programming/Drawing Book/Solution.java @@ -0,0 +1,31 @@ +// Author: Rodney Shaghoulian +// Github: github.com/rshaghoulian +// HackerRank: hackerrank.com/rshaghoulian + +import java.util.Scanner; + +// Explanation: +// - The last page is n/2 page turns away. +// - It takes p/2 pages to get to the p-th page (from the front) +// - It takes n/2 - p/2 pages to get to the p-th page (from the back) +// - The minimum of p/2 and (n/2 - p/2) is the minimum number of pages Brie must turn + +// Time complexity: O(1) +// Space complexity: O(1) +public class Solution { + static int solve (int n, int p) { + int pagesFromFront = p/2; + int pagesFromBack = n/2 - p/2; + return Math.min(pagesFromFront, pagesFromBack); + } + + public static void main(String[] args) { + Scanner scan = new Scanner(System.in); + int n = scan.nextInt(); + int p = scan.nextInt(); + scan.close(); + + int result = solve(n, p); + System.out.println(result); + } +} diff --git a/General Programming/Basic Programming/Electronics Shop/Solution.java b/General Programming/Basic Programming/Electronics Shop/Solution.java new file mode 100644 index 0000000..a9368e5 --- /dev/null +++ b/General Programming/Basic Programming/Electronics Shop/Solution.java @@ -0,0 +1,56 @@ +// Author: Rodney Shaghoulian +// Github: github.com/rshaghoulian +// HackerRank: hackerrank.com/rshaghoulian + +import java.util.Scanner; +import java.util.Arrays; + +// Algorithm: +// 1. Sort both arrays. +// 2. Linearly walk through both arrays (at the same time). +// If the combined price is unaffordable, find a cheaper harddrive (j--). +// If the combined price is too low, update "max", and find a more expensive keyboard (i++) + +// Time complexity: O(n log n + m log m) +public class Solution { + static int getMoneySpent(int[] keyboards, int[] drives, int s) { + Arrays.sort(keyboards); // O(n log n) time complexity + Arrays.sort(drives); // O(m log m) time complexity + int max = -1; + int i = 0; + int j = drives.length - 1; + while (i < keyboards.length && j >= 0) { // O(n + m) time complexity + int cost = keyboards[i] + drives[j]; + if (cost > s) { + j--; // look for a cheaper hard drive + } else { + if (cost > max) { + max = cost; + } + i++; // look for a more expensive keyboard + } + } + return max; + } + + public static void main(String[] args) { + /* Save input */ + Scanner scan = new Scanner(System.in); + int s = scan.nextInt(); + int n = scan.nextInt(); + int m = scan.nextInt(); + int[] keyboards = new int[n]; + for (int i = 0; i < n; i++) { + keyboards[i] = scan.nextInt(); + } + int[] drives = new int[m]; + for (int i = 0; i < m; i++) { + drives[i] = scan.nextInt(); + } + scan.close(); + + /* Calculate result */ + int moneySpent = getMoneySpent(keyboards, drives, s); + System.out.println(moneySpent); + } +} diff --git a/General Programming/Basic Programming/Equalize the Array/Solution.java b/General Programming/Basic Programming/Equalize the Array/Solution.java index 658c592..52769d2 100644 --- a/General Programming/Basic Programming/Equalize the Array/Solution.java +++ b/General Programming/Basic Programming/Equalize the Array/Solution.java @@ -11,7 +11,7 @@ public class Solution { private static final int size = 100; - public static void main(String [] args) { + public static void main(String[] args) { Scanner scan = new Scanner(System.in); int n = scan.nextInt(); int [] counts = new int[size + 1]; // could alternatively use a HashMap diff --git a/General Programming/Basic Programming/Grading Students/Solution.java b/General Programming/Basic Programming/Grading Students/Solution.java index 57e86de..3ce6b67 100644 --- a/General Programming/Basic Programming/Grading Students/Solution.java +++ b/General Programming/Basic Programming/Grading Students/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 n = scan.nextInt(); while (n-- > 0) { diff --git a/General Programming/Basic Programming/Jumping on the Clouds - Revisited/Solution.java b/General Programming/Basic Programming/Jumping on the Clouds - Revisited/Solution.java index f9e205e..e6fa475 100644 --- a/General Programming/Basic Programming/Jumping on the Clouds - Revisited/Solution.java +++ b/General Programming/Basic Programming/Jumping on the Clouds - Revisited/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) { int E = 100; /* Save input */ Scanner scan = new Scanner(System.in); diff --git a/General Programming/Basic Programming/Kangaroo/Solution.java b/General Programming/Basic Programming/Kangaroo/Solution.java index 14ba967..98a9071 100644 --- a/General Programming/Basic Programming/Kangaroo/Solution.java +++ b/General Programming/Basic Programming/Kangaroo/Solution.java @@ -13,7 +13,7 @@ import java.util.Scanner; // If the distance between the kangaroos (x2 - x1) is divisible by how much closer they get in each step (v2 - v1), then they will land at the same location at the same time. Otherwise, 1 kangaroo will jump over the other and they will never be at the same location at the same time. public class Solution { - public static void main(String [] args) { + public static void main(String[] args) { /* Save input */ Scanner scan = new Scanner(System.in); int x1 = scan.nextInt(); diff --git a/General Programming/Basic Programming/Manasa and Stones/Solution.java b/General Programming/Basic Programming/Manasa and Stones/Solution.java index 89a3a60..961444f 100644 --- a/General Programming/Basic Programming/Manasa and Stones/Solution.java +++ b/General Programming/Basic Programming/Manasa and Stones/Solution.java @@ -25,7 +25,7 @@ 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 T = scan.nextInt(); while (T-- > 0) { diff --git a/General Programming/Basic Programming/Migratory Birds/Solution.java b/General Programming/Basic Programming/Migratory Birds/Solution.java new file mode 100644 index 0000000..6a1c90c --- /dev/null +++ b/General Programming/Basic Programming/Migratory Birds/Solution.java @@ -0,0 +1,43 @@ +// Author: Rodney Shaghoulian +// Github: github.com/rshaghoulian +// HackerRank: hackerrank.com/rshaghoulian + +import java.util.Scanner; + +// Time Complexity: O(n) +public class Solution { + + static final int NUM_TYPES = 5; + + static int migratoryBirds(int[] birds) { + /* Get counts of each type */ + int[] count = new int[NUM_TYPES + 1]; + for (int num : birds) { + count[num]++; + } + + /* Find max */ + int maxIndex = 1; + for (int i = 0; i < count.length; i++) { + if (count[i] > count[maxIndex]) { + maxIndex = i; + } + } + return maxIndex; + } + + public static void main(String[] args) { + /* Save input */ + Scanner scan = new Scanner(System.in); + int n = scan.nextInt(); + int[] birds = new int[n]; + for (int i = 0; i < n; i++){ + birds[i] = scan.nextInt(); + } + scan.close(); + + /* Calculate result */ + int result = migratoryBirds(birds); + System.out.println(result); + } +} diff --git a/General Programming/Basic Programming/Minimum Distances/Solution.java b/General Programming/Basic Programming/Minimum Distances/Solution.java new file mode 100644 index 0000000..8024337 --- /dev/null +++ b/General Programming/Basic Programming/Minimum Distances/Solution.java @@ -0,0 +1,42 @@ +// Author: Rodney Shaghoulian +// Github: github.com/rshaghoulian +// HackerRank: hackerrank.com/rshaghoulian + +import java.util.Scanner; +import java.util.HashMap; + +// Main trick: Use a HashMap that maps from "value" to "index" +// to keep track of of the largest index for each value that we've +// seen so far as we loop through array + +// Time Complexity: O(n) +// Space Compleixty: O(n) +public class Solution { + public static void main(String[] args) { + /* Save input */ + Scanner scan = new Scanner(System.in); + int n = scan.nextInt(); + int[] array = new int[n]; + for (int i = 0; i < n; i++) { + array[i] = scan.nextInt(); + } + scan.close(); + + /* Calculate + print result */ + System.out.println(solve(array)); + } + + private static int solve(int[] array) { + HashMap map = new HashMap<>(); + int minDistance = Integer.MAX_VALUE; + for (int i = 0; i < array.length; i++) { + if (map.containsKey(array[i])) { + int prevIndex = map.get(array[i]); + int currDistance = i - prevIndex; + minDistance = Math.min(minDistance, currDistance); + } + map.put(array[i], i); + } + return minDistance == Integer.MAX_VALUE ? -1 : minDistance; + } +} diff --git a/General Programming/Basic Programming/Save the Prisoner!/Solution.java b/General Programming/Basic Programming/Save the Prisoner!/Solution.java index 3fec182..992bbda 100644 --- a/General Programming/Basic Programming/Save the Prisoner!/Solution.java +++ b/General Programming/Basic Programming/Save the Prisoner!/Solution.java @@ -16,7 +16,7 @@ since prisoners are counted from 1 to N while modular arithmetic is counted from */ 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/General Programming/Basic Programming/Sequence Equation/Solution.java b/General Programming/Basic Programming/Sequence Equation/Solution.java index 38421ee..29f28b8 100644 --- a/General Programming/Basic Programming/Sequence Equation/Solution.java +++ b/General Programming/Basic Programming/Sequence Equation/Solution.java @@ -10,7 +10,7 @@ import java.util.Scanner; // - We need find a y where p(p(y)) = x. This equation can be rewritten as y = p_inverse(p_inverse(x)), which is the version of the equation we use to calculate and print "y". public class Solution { - public static void main(String [] args) { + public static void main(String[] args) { /* Create function: p_inverse */ Scanner scan = new Scanner(System.in); int n = scan.nextInt(); diff --git a/General Programming/Basic Programming/Solve Me First/Solution.java b/General Programming/Basic Programming/Solve Me First/Solution.java index f1c320b..be46389 100644 --- a/General Programming/Basic Programming/Solve Me First/Solution.java +++ b/General Programming/Basic Programming/Solve Me First/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 a = scan.nextInt(); diff --git a/General Programming/Basic Programming/Staircase/Solution.java b/General Programming/Basic Programming/Staircase/Solution.java index 873a8e9..ed020bc 100644 --- a/General Programming/Basic Programming/Staircase/Solution.java +++ b/General Programming/Basic Programming/Staircase/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 n = scan.nextInt(); diff --git a/General Programming/Basic Programming/The Hurdle Race/Solution.java b/General Programming/Basic Programming/The Hurdle Race/Solution.java index b8f3e0d..c638e1c 100644 --- a/General Programming/Basic Programming/The Hurdle Race/Solution.java +++ b/General Programming/Basic Programming/The Hurdle Race/Solution.java @@ -6,7 +6,7 @@ import java.util.Scanner; import java.util.Arrays; 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/General Programming/Basic Programming/Utopian Tree/Solution.java b/General Programming/Basic Programming/Utopian Tree/Solution.java index 87ff826..92db969 100644 --- a/General Programming/Basic Programming/Utopian Tree/Solution.java +++ b/General Programming/Basic Programming/Utopian Tree/Solution.java @@ -8,7 +8,7 @@ import java.util.Arrays; // Time Complexity: O(N + T) // Space Complexity: O(N + T) public class Solution { - public static void main(String [] args) { + public static void main(String[] args) { /* Save input */ Scanner scan = new Scanner(System.in); int T = scan.nextInt(); diff --git a/General Programming/README.md b/General Programming/README.md index ab9e9ff..7572adc 100644 --- a/General Programming/README.md +++ b/General Programming/README.md @@ -1,7 +1,7 @@ # General Programming -| Subdomain | Challenge | Points | Solution | -|:---------------------------:|:----------------------------------------------------------------------------------------------------------------------------:|:------:|:-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------:| +| Subdomain | Challenge | Points | Solution | +|:---------------------------:|------------------------------------------------------------------------------------------------------------------------------|:------:|---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| | Basic Programming | [Solve Me First](https://www.hackerrank.com/challenges/solve-me-first) | 1 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Solve%20Me%20First/Solution.java) | | Basic Programming | [Staircase](https://www.hackerrank.com/challenges/staircase) | 10 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Staircase/Solution.java) | | Basic Programming | [Plus Minus](https://www.hackerrank.com/challenges/plus-minus) | 10 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Plus%20Minus/Solution.java) | @@ -11,30 +11,40 @@ | Basic Programming | [Compare the Triplets](https://www.hackerrank.com/challenges/compare-the-triplets) | 10 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Compare%20the%20Triplets/Solution.java) | | Basic Programming | [Divisible Sum Pairs](https://www.hackerrank.com/challenges/divisible-sum-pairs) | 10 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Divisible%20Sum%20Pairs/Solution.java) | | Basic Programming | [Kangaroo](https://www.hackerrank.com/challenges/kangaroo) | 10 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Kangaroo/Solution.java) | +| Basic Programming | [Drawing Book](https://www.hackerrank.com/challenges/drawing-book) | 10 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Drawing%20Book/Solution.java) | +| Basic Programming | [Birthday Cake Candles](https://www.hackerrank.com/challenges/birthday-cake-candles) | 10 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Birthday%20Cake%20Candles/Solution.java) | | Basic Programming | [Bon Appetit](https://www.hackerrank.com/challenges/bon-appetit) | 10 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Bon%20Appetit/Solution.java) | | Basic Programming | [Sock Merchant](https://www.hackerrank.com/challenges/sock-merchant) | 10 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Sock%20Merchant/Solution.java) | | Basic Programming | [Apple and Orange](https://www.hackerrank.com/challenges/apple-and-orange) | 10 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Apple%20and%20Orange/Solution.java) | | Basic Programming | [Between Two Sets](https://www.hackerrank.com/challenges/between-two-sets) | 10 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Between%20Two%20Sets/Solution.java) | | Basic Programming | [Mini-max Sum](https://www.hackerrank.com/challenges/mini-max-sum) | 10 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Mini-Max%20Sum/Solution.java) | | Basic Programming | [Grading Students](https://www.hackerrank.com/challenges/grading) | 10 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Grading%20Students/Solution.java) | +| Basic Programming | [Breaking the Records](https://www.hackerrank.com/challenges/breaking-best-and-worst-records) | 10 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Breaking%20the%20Records/Solution.java) | +| Basic Programming | [Migratory Birds](https://www.hackerrank.com/challenges/migratory-birds) | 10 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Migratory%20Birds/Solution.java) | +| Basic Programming | [Birthday Chocolate](https://www.hackerrank.com/challenges/the-birthday-bar) | 10 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Birthday%20Chocolate/Solution.java) | | Basic Programming | [Time Conversion](https://www.hackerrank.com/challenges/time-conversion) | 15 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Time%20Conversion/Solution.java) | | Basic Programming | [Library Fine](https://www.hackerrank.com/challenges/library-fine) | 15 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Library%20Fine/Solution.java) | | Basic Programming | [Save the Prisoner!](https://www.hackerrank.com/challenges/save-the-prisoner) | 15 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Save%20the%20Prisoner!/Solution.java) | | Basic Programming | [Jumping on the Clouds - Revisited](https://www.hackerrank.com/challenges/jumping-on-the-clouds-revisited) | 15 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Jumping%20on%20the%20Clouds%20-%20Revisited/Solution.java) | +| Basic Programming | [Counting Valleys](https://www.hackerrank.com/challenges/counting-valleys) | 15 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Counting%20Valleys/Solution.java) | | Basic Programming | [Viral Advertising](https://www.hackerrank.com/challenges/strange-advertising) | 15 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Viral%20Advertising/Solution.java) | | Basic Programming | [Beautiful Days at the Movies](https://www.hackerrank.com/challenges/beautiful-days-at-the-movies) | 15 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Beautiful%20Days%20at%20the%20Movies/Solution.java) | +| Basic Programming | [Electronics Shop](https://www.hackerrank.com/challenges/electronics-shop) | 15 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Electronics%20Shop/Solution.java) | +| Basic Programming | [Cat and a Mouse](https://www.hackerrank.com/challenges/cats-and-a-mouse) | 15 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Cats%20and%20a%20Mouse/Solution.java) | | Basic Programming | [The Hurdle Race](https://www.hackerrank.com/challenges/the-hurdle-race) | 15 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/The%20Hurdle%20Race/Solution.java) | | Basic Programming | [Utopian Tree](https://www.hackerrank.com/challenges/utopian-tree) | 20 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Utopian%20Tree/Solution.java) | | Basic Programming | [Circular Array Rotation](https://www.hackerrank.com/challenges/circular-array-rotation) | 20 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Circular%20Array%20Rotation/Solution.java) | | Basic Programming | [Sherlock and Squares](https://www.hackerrank.com/challenges/sherlock-and-squares) | 20 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Sherlock%20and%20Squares/Solution.java) | | Basic Programming | [Angry Professor](https://www.hackerrank.com/challenges/angry-professor) | 20 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Angry%20Professor/Solution.java) | | Basic Programming | [Extra Long Factorials](https://www.hackerrank.com/challenges/extra-long-factorials) | 20 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Extra%20Long%20Factorials/Solution.java) | +| Basic Programming | [Minimum Distances](https://www.hackerrank.com/challenges/minimum-distances) | 20 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Minimum%20Distances/Solution.java) | | Basic Programming | [Beautiful Triplets](https://www.hackerrank.com/challenges/beautiful-triplets) | 20 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Beautiful%20Triplets/Solution.java) | | Basic Programming | [Jumping on the Clouds](https://www.hackerrank.com/challenges/jumping-on-the-clouds) | 20 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Jumping%20on%20the%20Clouds/Solution.java) | | Basic Programming | [Equalize the Array](https://www.hackerrank.com/challenges/equality-in-a-array) | 20 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Equalize%20the%20Array/Solution.java) | | Basic Programming | [Designer PDF Viewer](https://www.hackerrank.com/challenges/designer-pdf-viewer) | 20 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Designer%20PDF%20Viewer/Solution.java) | | Basic Programming | [Repeated String](https://www.hackerrank.com/challenges/repeated-string) | 20 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Repeated%20String/Solution.java) | | Basic Programming | [Append and Delete](https://www.hackerrank.com/challenges/append-and-delete) | 20 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Append%20and%20Delete/Solution.java) | +| Basic Programming | [Climbing the Leaderboard](https://www.hackerrank.com/challenges/climbing-the-leaderboard) | 20 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Climbing%20the%20Leaderboard/Solution.java) | | Basic Programming | [Sequence Equation](https://www.hackerrank.com/challenges/permutation-equation) | 20 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Sequence%20Equation/Solution.java) | | Basic Programming | [Find Digits](https://www.hackerrank.com/challenges/find-digits) | 25 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Find%20Digits/Solution.java) | | Basic Programming | [Cut the sticks](https://www.hackerrank.com/challenges/cut-the-sticks) | 25 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Cut%20the%20sticks/Solution.java) | diff --git a/Java/Data Structures/Java 2D Array/Solution.java b/Java/Data Structures/Java 2D Array/Solution.java index 3a023f0..c27252c 100644 --- a/Java/Data Structures/Java 2D Array/Solution.java +++ b/Java/Data Structures/Java 2D Array/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/Java/Data Structures/Java Comparator/Solution.java b/Java/Data Structures/Java Comparator/Solution.java index 54ed89a..cf0052f 100644 --- a/Java/Data Structures/Java Comparator/Solution.java +++ b/Java/Data Structures/Java 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/Java/Data Structures/Java Dequeue/Solution.java b/Java/Data Structures/Java Dequeue/Solution.java index af32b8b..b97050b 100644 --- a/Java/Data Structures/Java Dequeue/Solution.java +++ b/Java/Data Structures/Java Dequeue/Solution.java @@ -15,7 +15,7 @@ import java.util.HashMap; // Space Complexity: O(n) public class test { - public static void main(String [] args) { + public static void main(String[] args) { HashMap map = new HashMap<>(); ArrayDeque deque = new ArrayDeque<>(); diff --git a/Java/Data Structures/Java Map/Solution.java b/Java/Data Structures/Java Map/Solution.java index 101602c..3a0d1b8 100644 --- a/Java/Data Structures/Java Map/Solution.java +++ b/Java/Data Structures/Java Map/Solution.java @@ -10,7 +10,7 @@ import java.util.HashMap; /* BufferedReader is used instead of Scanner since it's faster and won't time out on HackerRank test cases when using Java8 */ class Solution { - public static void main(String [] args) throws IOException { + public static void main(String[] args) throws IOException { /* Save input as entries in a HashMap */ BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int n = Integer.parseInt(br.readLine()); diff --git a/Java/Object Oriented Programming/Java Method Overriding 2 (Super Keyword)/Solution.java b/Java/Object Oriented Programming/Java Method Overriding 2 (Super Keyword)/Solution.java index 16b9561..4e9d96e 100644 --- a/Java/Object Oriented Programming/Java Method Overriding 2 (Super Keyword)/Solution.java +++ b/Java/Object Oriented Programming/Java Method Overriding 2 (Super Keyword)/Solution.java @@ -24,7 +24,7 @@ class MotorCycle extends BiCycle { } class Solution { - public static void main(String [] args) { + public static void main(String[] args) { MotorCycle M = new MotorCycle(); } } diff --git a/Java/Object Oriented Programming/Java Method Overriding/Solution.java b/Java/Object Oriented Programming/Java Method Overriding/Solution.java index 1cfb3d0..770e0b0 100644 --- a/Java/Object Oriented Programming/Java Method Overriding/Solution.java +++ b/Java/Object Oriented Programming/Java Method Overriding/Solution.java @@ -27,7 +27,7 @@ class Soccer extends Sports { } public class Solution { - public static void main(String [] args) { + public static void main(String[] args) { Sports c1 = new Sports(); Soccer c2 = new Soccer(); System.out.println(c1.getName()); diff --git a/Java/Strings/Pattern Syntax Checker/Solution.java b/Java/Strings/Pattern Syntax Checker/Solution.java index 34b0e1f..6fa03a3 100644 --- a/Java/Strings/Pattern Syntax Checker/Solution.java +++ b/Java/Strings/Pattern Syntax Checker/Solution.java @@ -10,7 +10,8 @@ import java.util.regex.PatternSyntaxException; public class Solution { public static void main(String[] args) { Scanner scan = new Scanner(System.in); - int testCases = Integer.parseInt(scan.nextLine()); + int testCases = scan.nextInt(); + scan.nextLine(); // gets rid of the pesky newline. while (testCases-- > 0) { String pattern = scan.nextLine(); try { diff --git a/README.md b/README.md index 4821dd0..42a69c7 100644 --- a/README.md +++ b/README.md @@ -2,7 +2,7 @@ -
302 efficient solutions to HackerRank problems +
HackerRank Solutions - 312 efficient solutions to HackerRank problems

* [10 Days of Statistics](#10-days-of-statistics) @@ -206,8 +206,8 @@ SQL solutions are coded using MySQL # General Programming -| Subdomain | Challenge | Points | Solution | -|:---------------------------:|:----------------------------------------------------------------------------------------------------------------------------:|:------:|:-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------:| +| Subdomain | Challenge | Points | Solution | +|:---------------------------:|------------------------------------------------------------------------------------------------------------------------------|:------:|---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------| | Basic Programming | [Solve Me First](https://www.hackerrank.com/challenges/solve-me-first) | 1 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Solve%20Me%20First/Solution.java) | | Basic Programming | [Staircase](https://www.hackerrank.com/challenges/staircase) | 10 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Staircase/Solution.java) | | Basic Programming | [Plus Minus](https://www.hackerrank.com/challenges/plus-minus) | 10 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Plus%20Minus/Solution.java) | @@ -217,30 +217,40 @@ SQL solutions are coded using MySQL | Basic Programming | [Compare the Triplets](https://www.hackerrank.com/challenges/compare-the-triplets) | 10 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Compare%20the%20Triplets/Solution.java) | | Basic Programming | [Divisible Sum Pairs](https://www.hackerrank.com/challenges/divisible-sum-pairs) | 10 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Divisible%20Sum%20Pairs/Solution.java) | | Basic Programming | [Kangaroo](https://www.hackerrank.com/challenges/kangaroo) | 10 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Kangaroo/Solution.java) | +| Basic Programming | [Drawing Book](https://www.hackerrank.com/challenges/drawing-book) | 10 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Drawing%20Book/Solution.java) | +| Basic Programming | [Birthday Cake Candles](https://www.hackerrank.com/challenges/birthday-cake-candles) | 10 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Birthday%20Cake%20Candles/Solution.java) | | Basic Programming | [Bon Appetit](https://www.hackerrank.com/challenges/bon-appetit) | 10 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Bon%20Appetit/Solution.java) | | Basic Programming | [Sock Merchant](https://www.hackerrank.com/challenges/sock-merchant) | 10 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Sock%20Merchant/Solution.java) | | Basic Programming | [Apple and Orange](https://www.hackerrank.com/challenges/apple-and-orange) | 10 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Apple%20and%20Orange/Solution.java) | | Basic Programming | [Between Two Sets](https://www.hackerrank.com/challenges/between-two-sets) | 10 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Between%20Two%20Sets/Solution.java) | | Basic Programming | [Mini-max Sum](https://www.hackerrank.com/challenges/mini-max-sum) | 10 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Mini-Max%20Sum/Solution.java) | | Basic Programming | [Grading Students](https://www.hackerrank.com/challenges/grading) | 10 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Grading%20Students/Solution.java) | +| Basic Programming | [Breaking the Records](https://www.hackerrank.com/challenges/breaking-best-and-worst-records) | 10 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Breaking%20the%20Records/Solution.java) | +| Basic Programming | [Migratory Birds](https://www.hackerrank.com/challenges/migratory-birds) | 10 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Migratory%20Birds/Solution.java) | +| Basic Programming | [Birthday Chocolate](https://www.hackerrank.com/challenges/the-birthday-bar) | 10 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Birthday%20Chocolate/Solution.java) | | Basic Programming | [Time Conversion](https://www.hackerrank.com/challenges/time-conversion) | 15 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Time%20Conversion/Solution.java) | | Basic Programming | [Library Fine](https://www.hackerrank.com/challenges/library-fine) | 15 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Library%20Fine/Solution.java) | | Basic Programming | [Save the Prisoner!](https://www.hackerrank.com/challenges/save-the-prisoner) | 15 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Save%20the%20Prisoner!/Solution.java) | | Basic Programming | [Jumping on the Clouds - Revisited](https://www.hackerrank.com/challenges/jumping-on-the-clouds-revisited) | 15 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Jumping%20on%20the%20Clouds%20-%20Revisited/Solution.java) | +| Basic Programming | [Counting Valleys](https://www.hackerrank.com/challenges/counting-valleys) | 15 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Counting%20Valleys/Solution.java) | | Basic Programming | [Viral Advertising](https://www.hackerrank.com/challenges/strange-advertising) | 15 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Viral%20Advertising/Solution.java) | | Basic Programming | [Beautiful Days at the Movies](https://www.hackerrank.com/challenges/beautiful-days-at-the-movies) | 15 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Beautiful%20Days%20at%20the%20Movies/Solution.java) | +| Basic Programming | [Electronics Shop](https://www.hackerrank.com/challenges/electronics-shop) | 15 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Electronics%20Shop/Solution.java) | +| Basic Programming | [Cat and a Mouse](https://www.hackerrank.com/challenges/cats-and-a-mouse) | 15 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Cats%20and%20a%20Mouse/Solution.java) | | Basic Programming | [The Hurdle Race](https://www.hackerrank.com/challenges/the-hurdle-race) | 15 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/The%20Hurdle%20Race/Solution.java) | | Basic Programming | [Utopian Tree](https://www.hackerrank.com/challenges/utopian-tree) | 20 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Utopian%20Tree/Solution.java) | | Basic Programming | [Circular Array Rotation](https://www.hackerrank.com/challenges/circular-array-rotation) | 20 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Circular%20Array%20Rotation/Solution.java) | | Basic Programming | [Sherlock and Squares](https://www.hackerrank.com/challenges/sherlock-and-squares) | 20 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Sherlock%20and%20Squares/Solution.java) | | Basic Programming | [Angry Professor](https://www.hackerrank.com/challenges/angry-professor) | 20 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Angry%20Professor/Solution.java) | | Basic Programming | [Extra Long Factorials](https://www.hackerrank.com/challenges/extra-long-factorials) | 20 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Extra%20Long%20Factorials/Solution.java) | +| Basic Programming | [Minimum Distances](https://www.hackerrank.com/challenges/minimum-distances) | 20 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Minimum%20Distances/Solution.java) | | Basic Programming | [Beautiful Triplets](https://www.hackerrank.com/challenges/beautiful-triplets) | 20 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Beautiful%20Triplets/Solution.java) | | Basic Programming | [Jumping on the Clouds](https://www.hackerrank.com/challenges/jumping-on-the-clouds) | 20 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Jumping%20on%20the%20Clouds/Solution.java) | | Basic Programming | [Equalize the Array](https://www.hackerrank.com/challenges/equality-in-a-array) | 20 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Equalize%20the%20Array/Solution.java) | | Basic Programming | [Designer PDF Viewer](https://www.hackerrank.com/challenges/designer-pdf-viewer) | 20 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Designer%20PDF%20Viewer/Solution.java) | | Basic Programming | [Repeated String](https://www.hackerrank.com/challenges/repeated-string) | 20 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Repeated%20String/Solution.java) | | Basic Programming | [Append and Delete](https://www.hackerrank.com/challenges/append-and-delete) | 20 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Append%20and%20Delete/Solution.java) | +| Basic Programming | [Climbing the Leaderboard](https://www.hackerrank.com/challenges/climbing-the-leaderboard) | 20 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Climbing%20the%20Leaderboard/Solution.java) | | Basic Programming | [Sequence Equation](https://www.hackerrank.com/challenges/permutation-equation) | 20 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Sequence%20Equation/Solution.java) | | Basic Programming | [Find Digits](https://www.hackerrank.com/challenges/find-digits) | 25 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Find%20Digits/Solution.java) | | Basic Programming | [Cut the sticks](https://www.hackerrank.com/challenges/cut-the-sticks) | 25 | [Solution.java](https://github.com/rshaghoulian/HackerRank-solutions/blob/master/General%20Programming/Basic%20Programming/Cut%20the%20sticks/Solution.java) |