format

Author: fishercoder1534

README.md

@@ -110,7 +110,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |515|[Find Largest Value in Each Tree Row](https://leetcode.com/problems/find-largest-value-in-each-tree-row/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_515.java) | O(n) |O(k) | Medium| BFS
 |514|[Freedom Trail](https://leetcode.com/problems/freedom-trail/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_514.java) | O(?) |O(?) | Hard | DP
 |513|[Find Bottom Left Tree Value](https://leetcode.com/problems/find-bottom-left-tree-value/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_513.java) | O(n) |O(k) | Medium| BFS
-|508|[Most Frequent Subtree Sum](https://leetcode.com/problems/most-frequent-subtree-sum/)|[Solution](../master/src/main/java/com/fishercoder/solutions/MostFrequentSubtreeSum.java) | O(n) |O(n) | Medium| DFS, Tree
+|508|[Most Frequent Subtree Sum](https://leetcode.com/problems/most-frequent-subtree-sum/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_508.java) | O(n) |O(n) | Medium| DFS, Tree
 |507|[Perfect Number](https://leetcode.com/problems/perfect-number/)|[Solution](../master/src/main/java/com/fishercoder/solutions/PerfectNumber.java) | O(sqrt(n)) |O(1) | Easy| Math
 |506|[Relative Ranks](https://leetcode.com/problems/relative-ranks/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_506.java) | O(nlogn) |O(n) | Easy|
 |505|[The Maze II](https://leetcode.com/problems/the-maze-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_505.java) | O(m*n) |O(m*n) | Medium| BFS

src/main/java/com/fishercoder/solutions/MostFrequentSubtreeSum.java renamed to src/main/java/com/fishercoder/solutions/_508.java

@@ -5,7 +5,9 @@
 import java.util.*;
 
 /**
- * Given the root of a tree, you are asked to find the most frequent subtree sum. The subtree sum of a node is defined as the sum of all the node values formed by the subtree rooted at that node (including the node itself). So what is the most frequent subtree sum value? If there is a tie, return all the values with the highest frequency in any order.
+ * Given the root of a tree, you are asked to find the most frequent subtree sum.
+ * The subtree sum of a node is defined as the sum of all the node values formed by the subtree rooted at that node (including the node itself).
+ * So what is the most frequent subtree sum value? If there is a tie, return all the values with the highest frequency in any order.
 
  Examples 1
  Input:
@@ -24,7 +26,7 @@
 
  Note: You may assume the sum of values in any subtree is in the range of 32-bit signed integer.
  */
-public class MostFrequentSubtreeSum {
+public class _508 {
 
     //my purely original but verbose solution
     public int[] findFrequentTreeSum(TreeNode root) {

src/test/java/com/fishercoder/MostFrequentSubtreeSumTest.java renamed to src/test/java/com/fishercoder/_508Test.java

@@ -1,22 +1,22 @@
 package com.fishercoder;
 
 import com.fishercoder.common.classes.TreeNode;
-import com.fishercoder.solutions.MostFrequentSubtreeSum;
+import com.fishercoder.solutions._508;
 import org.junit.Before;
 import org.junit.BeforeClass;
 import org.junit.Test;
 
 import static org.junit.Assert.assertArrayEquals;
 
-public class MostFrequentSubtreeSumTest {
-    private static MostFrequentSubtreeSum test;
+public class _508Test {
+    private static _508 test;
     private static int[] expected;
     private static int[] actual;
     private static TreeNode root;
 
     @BeforeClass
     public static void setup(){
-        test = new MostFrequentSubtreeSum();
+        test = new _508();
     }
 
     @Before