refactor 30

fishercoder1534 · fishercoder1534 · commit af9df665785c · 2020-04-28T08:25:25.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_30.java b/src/main/java/com/fishercoder/solutions/_30.java
@@ -5,19 +5,6 @@
 import java.util.List;
 import java.util.Map;
 
-/**
- * 30. Substring with Concatenation of All Words
- *
- * You are given a string, s, and a list of words, words, that are all of the same length.
- * Find all starting indices of substring(s) in s that is a concatenation of each word in words exactly once and without any intervening characters.
-
- For example, given:
- s: "barfoothefoobarman"
- words: ["foo", "bar"]
-
- You should return the indices: [0,9].
- (order does not matter).
- */
 public class _30 {
 
   public static class Solution1 {
