deepakavs
diff --git a/‎README.md
Lines changed: 2 additions & 2 deletions b/‎README.md
Lines changed: 2 additions & 2 deletions
diff --git a/‎src/main/java/com/fishercoder/solutions/DivideTwoIntegers.java renamed to ‎src/main/java/com/fishercoder/solutions/_29.java
Lines changed: 1 addition & 1 deletion b/‎src/main/java/com/fishercoder/solutions/DivideTwoIntegers.java renamed to ‎src/main/java/com/fishercoder/solutions/_29.java
Lines changed: 1 addition & 1 deletion
diff --git a/‎src/main/java/com/fishercoder/solutions/SubstringwithConcatenationofAllWords.java renamed to ‎src/main/java/com/fishercoder/solutions/_30.java
Lines changed: 5 additions & 2 deletions b/‎src/main/java/com/fishercoder/solutions/SubstringwithConcatenationofAllWords.java renamed to ‎src/main/java/com/fishercoder/solutions/_30.java
Lines changed: 5 additions & 2 deletions
@@ -491,8 +491,8 @@ Your ideas/fixes/algorithms are more than welcome!
 |33|[Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_33.java)|O(logn)|O(1)|Medium|Binary Search
 |32|[Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses/)|[Solution](../master/src/main/java/com/fishercoder/solutions/LongestValidParentheses.java)|O(n)|O(n)|Hard|Stack, DP
 |31|[Next Permutation](https://leetcode.com/problems/next-permutation)|[Solution](../master/src/main/java/com/fishercoder/solutions/NextPermutation.java)|O(n)|O(1)|Medium|Array
-|30|[Substring with Concatenation of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-words/)|[Solution](../master/src/main/java/com/fishercoder/solutions/SubstringwithConcatenationofAllWords.java)|O(n^2)|O(n)|Hard| HashMap
-|29|[Divide Two Integers](https://leetcode.com/problems/divide-two-integers/)|[Solution](../master/src/main/java/com/fishercoder/solutions/DivideTwoIntegers.java)|O(?)|O(?)|Medium|
+|30|[Substring with Concatenation of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-words/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_30.java)|O(n^2)|O(n)|Hard| HashMap
+|29|[Divide Two Integers](https://leetcode.com/problems/divide-two-integers/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_29.java)|O(?)|O(?)|Medium|
 |28|[Implement strStr()](https://leetcode.com/problems/implement-strstr/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_28.java)|O(n)|O(1)|Easy| String
 |27|[Remove Element](https://leetcode.com/problems/remove-element/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_27.java)|O(n)|O(1)| Easy |
 |26|[Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_26.java)|O(n)|O(1)|Easy| Array 
 
@@ -5,7 +5,7 @@
 
  If it is overflow, return MAX_INT.
  */
-public class DivideTwoIntegers {
+public class _29 {
 
     public int divide(int dividend, int divisor) {
         if (divisor == 0 || (dividend == Integer.MIN_VALUE && divisor == -1))
 
@@ -5,7 +5,10 @@
 import java.util.List;
 
 /**
- * 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.
+ * 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"
@@ -14,7 +17,7 @@
  You should return the indices: [0,9].
  (order does not matter).
  */
-public class SubstringwithConcatenationofAllWords {
+public class _30 {
 
     public List<Integer> findSubstring(String S, String[] L) {
         ArrayList<Integer> res = new ArrayList();