Add solution for 1023

Author: havanagrawal

README.md

@@ -27,6 +27,7 @@ Your ideas/fixes/algorithms are more than welcome!
 
 |  #  |      Title     |   Solutions   | Time          | Space         | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|---------------|---------------|--------|-------------|-------------
+|1023|[Camelcase Matching](https://leetcode.com/problems/camelcase-matching/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1023.java)| O(mn) | O(n) | |Medium| String |
 |1022|[Sum of Root To Leaf Binary Numbers](https://leetcode.com/problems/sum-of-root-to-leaf-binary-numbers/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1022.java) | O(n) | O(n) | |Easy|
 |1021|[Remove Outermost Parentheses](https://leetcode.com/problems/remove-outermost-parentheses/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1021.java) | O(n) | O(n) | |Easy|
 |1018|[Binary Prefix Divisible By 5](https://leetcode.com/problems/binary-prefix-divisible-by-5/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1018.java) | O(n) | O(1) | |Easy|

src/main/java/com/fishercoder/solutions/_1023.java

@@ -0,0 +1,56 @@
+package com.fishercoder.solutions;
+
+import java.util.ArrayList;
+import java.util.List;
+
+/*
+ * A query word matches a given pattern if we can insert lowercase letters to the pattern word so that it
+ * equals the query. (We may insert each character at any position, and may insert 0 characters.)
+ *
+ * Given a list of queries, and a pattern, return an answer list of booleans,
+ * where answer[i] is true if and only if queries[i] matches the pattern.
+ *
+ * Example:
+ * queries = ["FooBar","FooBarTest","FootBall","FrameBuffer","ForceFeedBack"], pattern = "FB"
+ * Output: [true,false,true,true,false]
+ *
+ * queries = ["FooBar","FooBarTest","FootBall","FrameBuffer","ForceFeedBack"], pattern = "FoBaT"
+ * Output: [false,true,false,false,false]
+ */
+
+public class _1023 {
+
+  public static class Solution1 {
+    public List<Boolean> camelMatch(String[] queries, String pattern) {
+      List<Boolean> res = new ArrayList<>();
+
+      for (String s : queries) {
+        res.add(match(s, pattern));
+      }
+
+      return res;
+    }
+
+    public boolean match(String s, String pattern) {
+      char[] st = s.toCharArray();
+
+      int i = 0;
+      for (char c : pattern.toCharArray()) {
+        while (i < st.length && st[i] != c) {
+          if (Character.isUpperCase(st[i])) return false;
+          ++i;
+        }
+
+        if (i == st.length) return false;
+        ++i;
+      }
+
+      while (i < st.length) {
+        if (Character.isUpperCase(st[i])) return false;
+        ++i;
+      }
+
+      return true;
+    }
+  }
+}

src/test/java/com/fishercoder/_1023Test.java

@@ -0,0 +1,41 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1023;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import java.util.Arrays;
+import java.util.List;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1023Test {
+    private static _1023.Solution1 solution1;
+    private String[] input = {"FooBar", "FooBarTest", "FootBall", "FrameBuffer", "ForceFeedBack"};
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1023.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        String pattern = "FB";
+        List<Boolean> expected = Arrays.asList(true, false, true, true, false);
+        assertEquals(solution1.camelMatch(input, pattern), expected);
+    }
+
+    @Test
+    public void test2() {
+        String pattern = "FoBa";
+        List<Boolean> expected = Arrays.asList(true, false, true, false, false);
+        assertEquals(solution1.camelMatch(input, pattern), expected);
+    }
+
+    @Test
+    public void test3() {
+        String pattern = "FoBaT";
+        List<Boolean> expected = Arrays.asList(false, true, false, false, false);
+        assertEquals(solution1.camelMatch(input, pattern), expected);
+    }
+}