Accepted

Author: gouthampradhan

problems/src/PascalsTriangle.java

@@ -0,0 +1,45 @@
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.List;
+
+/**
+ * Created by gouthamvidyapradhan on 25/03/2017.
+ * Accepted
+ */
+public class PascalsTriangle
+{
+    public static void main(String[] args) throws Exception
+    {
+        System.out.println(new PascalsTriangle().getRow(3));
+    }
+
+    public List<Integer> getRow(int rowIndex)
+    {
+        int k  = rowIndex;
+        if(k == 0)
+            return Arrays.asList(1);
+        else if(k == 1)
+            return Arrays.asList(1, 1);
+        else if (k == 2)
+            return Arrays.asList(1, 2, 1);
+        List<Integer> result = new ArrayList<>();
+        result.add(2);
+        k = k - 2;
+        int p, c;
+        while(k-- > 0)
+        {
+            p = 1;
+            int i = 0;
+            for(int l = result.size(); i < l; i ++)
+            {
+                c = result.get(i);
+                result.set(i, p + c);
+                p = c;
+            }
+            result.add(p + 1);
+        }
+        result.add(0, 1);
+        result.add(1);
+        return result;
+    }
+}

problems/src/RepeatedSubstringPattern.java

@@ -0,0 +1,42 @@
+/**
+ * Created by gouthamvidyapradhan on 25/03/2017.
+ * Accepted
+ */
+public class RepeatedSubstringPattern
+{
+    /**
+     * Main method
+     * @param args
+     * @throws Exception
+     */
+    public static void main(String[] args) throws Exception
+    {
+        System.out.println(new RepeatedSubstringPattern().repeatedSubstringPattern("a"));
+    }
+
+    public boolean repeatedSubstringPattern(String s)
+    {
+        boolean found;
+        for(int i = 1, l = s.length(); i < l; i ++)
+        {
+            found = true;
+            String subI = s.substring(0, i);
+            int j = i;
+            if(j >= l) return false;
+            while(j < l)
+            {
+                if((j + i) >= l + 1)
+                    return false;
+                String subJ = s.substring(j , j + i);
+                if(!subI.equals(subJ))
+                {
+                    found = false;
+                    break;
+                }
+                j += i;
+            }
+            if(found) return true;
+        }
+        return false;
+    }
+}

problems/src/SortCharByFrequency.java

@@ -0,0 +1,57 @@
+import java.util.*;
+
+/**
+ * Created by gouthamvidyapradhan on 25/03/2017.
+ * Accepted
+ */
+public class SortCharByFrequency
+{
+    class Freq
+    {
+        int i;
+        int c;
+    }
+
+    private int[] buff = new int[256];
+    /**
+     * Main method
+     * @param args
+     * @throws Exception
+     */
+    public static void main(String[] args) throws Exception
+    {
+        System.out.println(new SortCharByFrequency().frequencySort("askdfkasdkfasdkljfklasdjfkl"));
+    }
+
+    public String frequencySort(String s)
+    {
+        if(s == null || s.isEmpty()) return s;
+        Arrays.fill(buff, 0);
+        StringBuilder sb = new StringBuilder();
+        for(int i = 0, l = s.length(); i < l; i ++)
+            buff[s.charAt(i)]++;
+
+        List<Freq> fList = new ArrayList<>();
+        for(int i = 0; i < 256; i ++)
+        {
+            if(buff[i] > 0)
+            {
+                Freq f = new Freq();
+                f.i = i;
+                f.c = buff[i];
+                fList.add(f);
+            }
+        }
+
+        Collections.sort(fList, (o1, o2) -> Integer.compare(o2.c, o1.c));
+
+        for(Freq f : fList)
+        {
+            char c = (char)f.i;
+            int freq = f.c;
+            while(freq-- > 0)
+                sb.append(c);
+        }
+        return sb.toString();
+    }
+}

problems/src/ThirdMaximumNumber.java

@@ -0,0 +1,44 @@
+import com.sun.tools.internal.ws.wsdl.document.soap.SOAPUse;
+
+/**
+ * Created by gouthamvidyapradhan on 25/03/2017.
+ * Accepted
+ */
+public class ThirdMaximumNumber
+{
+    /**
+     * Main method
+     * @param args
+     * @throws Exception
+     */
+    public static void main(String[] args) throws Exception
+    {
+        int[] a = {1, 2};
+        System.out.println(new ThirdMaximumNumber().thirdMax(a));
+    }
+
+    public int thirdMax(int[] nums)
+    {
+        long[] max =  {Long.MIN_VALUE, Long.MIN_VALUE, Long.MIN_VALUE};
+        int count = 0;
+        for (int num : nums) {
+            for (int j = 0; j < 3; j++) {
+                if (max[j] > num) continue;
+                else if (max[j] == num) break;
+                int k = j;
+                long temp1, temp2;
+                temp1 = num;
+                count++;
+                while (k < 3) {
+                    temp2 = max[k];
+                    max[k] = temp1;
+                    temp1 = temp2;
+                    k++;
+                }
+                break;
+            }
+        }
+        System.out.println(Integer.MIN_VALUE);
+        return (count >= 3)? (int)max[2] : (int)max[0];
+    }
+}

problems/src/WordLadderII.java

@@ -2,6 +2,7 @@
 
 /**
  * Created by gouthamvidyapradhan on 24/03/2017.
+ * Accepted
  */
 public class WordLadderII
 {