edit 27

Author: fishercoder1534

README.md

@@ -494,7 +494,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |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|
 |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/RemoveElement.java)|O(n)|O(1)| Easy |
+|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 
 |25|[Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_25.java)|O(n)|O(1)| Hard | Recursion, LinkedList
 |24|[Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_24.java)|O(n)|O(h)|Medium| Recursion, LinkedList

src/main/java/com/fishercoder/solutions/RemoveElement.java src/main/java/com/fishercoder/solutions/_27.java

@@ -12,7 +12,7 @@
 Given input array nums = [3,2,2,3], val = 3
 
 Your function should return length = 2, with the first two elements of nums being 2.*/
-public class RemoveElement {
+public class _27 {
     //then I looked at the Editorial solution, really neat!!! Super elegant and smart!
     public int removeElement_editorial_solution_1(int[] nums, int val){
         //use two pointers, increment j as long as its not equal to val, return i in the end
@@ -60,7 +60,7 @@ public int removeElement(int[] nums, int val) {
 	}
 
 	public static void main(String...strings){
-		RemoveElement test = new RemoveElement();
+		_27 test = new _27();
 //		int[] nums = new int[]{3,2,2,3};
 //		int val = 3;