Algorithms - Dynamic Programming - Stock Maximize

Stock Maximize.

The following is the solution to Hacker Rank problem Stock Maximize using Java.  For solutions to other Hacker Rank Problem visit my page HackerRank, alternatively try searching for the problem in my blog.

Score: 36/36

import java.util.Scanner; public class StockMaximize {        public static void main(String[] args) {               /*                * Enter your code here. Read input from STDIN. Print output to STDOUT.                * Your class should be named Solution.                */               Scanner sc = new Scanner(System.in);               int numOfTestCase = sc.nextInt();               for (int i = 0; i < numOfTestCase; i++) {                      int n = sc.nextInt();                      long profit = 0;                      int[] stockPrice = new int[n];                      for (int j = 0; j < n; j++) {                            stockPrice[j] = sc.nextInt();                      }                                           int currMax = Integer.MIN_VALUE;                                           for (int j = n - 1; j >= 0; j--) {                            if (currMax < stockPrice[j]) {                                   currMax = stockPrice[j];                            }                            profit += (currMax - stockPrice[j]);                      }                      System.out.println(profit);                                           sc.close();               }        } }

Algorithms - Combinatorics - Building a List

Building a List

The following is the solution to Hacker Rank problem Building a List using Java.  For solutions to other Hacker Rank Problem visit my page HackerRank, alternatively try searching for the problem in my blog.

Score: 5/5

/**  *  */ import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.io.PrintWriter; import java.util.ArrayList; import java.util.StringTokenizer; /**  * @author Arun.G  *  */ public class Solution {        BufferedReader reader;        StringTokenizer tokenizer;        PrintWriter out;        private StringBuilder output = new StringBuilder();        String inputstring = "";               private void combine(int start) {               for (int i = start; i < inputstring.length(); ++i) {                      output.append(inputstring.charAt(i));                      if (!output.equals(""))                            System.out.println(output);                      if (i < inputstring.length())                            combine(i + 1);                      output.setLength(output.length() - 1);               }        }        public void solve() throws IOException {               int T = nextInt();               for (int count = 0; count < T; count++) {                      nextInt(); // to get N value, but it is used                      inputstring = nextToken();                      combine(0);               }        }        /**         * @param args         */        public static void main(String[] args) {               new Solution().run();        }        public void run() {               try {                      reader = new BufferedReader(new InputStreamReader(System.in));                      tokenizer = null;                      out = new PrintWriter(System.out);                      solve();                      reader.close();                      out.close();               } catch (Exception e) {                      e.printStackTrace();                      System.exit(1);               }        }        int nextInt() throws IOException {               return Integer.parseInt(nextToken());        }        long nextLong() throws IOException {               return Long.parseLong(nextToken());        }        double nextDouble() throws IOException {               return Double.parseDouble(nextToken());        }        String nextToken() throws IOException {               while (tokenizer == null || !tokenizer.hasMoreTokens()) {                      tokenizer = new StringTokenizer(reader.readLine());               }               return tokenizer.nextToken();        } }