Added 2 solutions & modified 1 solution

varunu28 · varunu28 · commit 69c9ed642ce9 · 2020-08-19T13:15:03.000-05:00
diff --git a/Easy/Count Good Triplets.java b/Easy/Count Good Triplets.java
@@ -0,0 +1,20 @@
+class Solution {
+  public int countGoodTriplets(int[] arr, int a, int b, int c) {
+    int count = 0;
+    int n = arr.length;
+    for (int i = 0; i < n; i++) {
+      for (int j = i + 1; j < n; j++) {
+        for (int k = j + 1; k < n; k++) {
+          if (
+            Math.abs(arr[i] - arr[j]) <= a && 
+            Math.abs(arr[j] - arr[k]) <= b && 
+            Math.abs(arr[k] - arr[i]) <= c
+          ) {
+            count++;  
+          }
+        }
+      }
+    }
+    return count;
+  }
+}
diff --git a/Easy/Number of Days in a Month.java b/Easy/Number of Days in a Month.java
@@ -1,24 +1,7 @@
 class Solution {
-    public int numberOfDays(int Y, int M) {
-        int[] arr = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
-        if (M == 2) {
-            return isLeapYear(Y) ? arr[M - 1] + 1 : arr[M - 1];
-        }
-
-        return arr[M- 1];
-    }
-
-    private boolean isLeapYear (int y) {
-        if (y % 4  == 0) {
-            if (y % 100 == 0) {
-                return y % 400 == 0;
-            }
-            else {
-                return true;
-            }
-        }
-        else {
-            return false;
-        }
-    }
+  final int[] DAY_COUNT = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
+  public int numberOfDays(int Y, int M) {
+    boolean isLeapYear = Y % 4 == 0 && ((Y % 100 == 0) ? (Y % 400 == 0) : true);
+    return DAY_COUNT[M - 1] + (M == 2 ? (isLeapYear ? 1 : 0) : 0);
+  }
 }
diff --git a/Easy/String Matching in an Array.java b/Easy/String Matching in an Array.java
@@ -0,0 +1,26 @@
+class Solution {
+  public List<String> stringMatching(String[] words) {
+    List<String> list = new ArrayList<>();
+    for (int i = 0; i < words.length; i++) {
+      for (int j = 0; j < words.length; j++) {
+        if (i != j && isSubstring(words[i], words[j])) {
+          list.add(words[i]);
+          break;
+        }
+      }
+    }
+    return list;
+  }
+  
+  private boolean isSubstring(String s1, String s2) {
+    if (s1.length() > s2.length()) {
+      return false;
+    }
+    for (int i = 0; i < s2.length() - s1.length() + 1; i++) {
+      if (s2.substring(i, i + s1.length()).equals(s1)) {
+        return true;
+      }
+    }
+    return false;
+  }
+}
