Improved base package structure

Author: borrelunde

src/main/java/com/bl/add_two_numbers/ListNode.java renamed to src/main/java/com/borrelunde/leetcodesolutions/add_two_numbers/ListNode.java

@@ -1,4 +1,4 @@
-package com.bl.add_two_numbers;
+package com.borrelunde.leetcodesolutions.add_two_numbers;
 
 /**
  * Definition for singly-linked list.

src/main/java/com/bl/add_two_numbers/README.md renamed to src/main/java/com/borrelunde/leetcodesolutions/add_two_numbers/README.md

@@ -1,4 +1,4 @@
-package com.bl.add_two_numbers;
+package com.borrelunde.leetcodesolutions.add_two_numbers;
 
 /**
  * This is the solution to the LeetCode problem: 2. Add Two Numbers

src/main/java/com/bl/add_two_numbers/Solution.java renamed to src/main/java/com/borrelunde/leetcodesolutions/add_two_numbers/Solution.java

@@ -1,4 +1,4 @@
-package com.bl.binary_search;
+package com.borrelunde.leetcodesolutions.binary_search;
 
 /**
  * This is the solution to the LeetCode problem: 704. Binary Search

src/main/java/com/bl/add_two_numbers/img/example_1_illustration.png renamed to src/main/java/com/borrelunde/leetcodesolutions/add_two_numbers/img/example_1_illustration.png

@@ -1,4 +1,4 @@
-package com.bl.fibonacci_number;
+package com.borrelunde.leetcodesolutions.fibonacci_number;
 
 import java.util.ArrayList;
 import java.util.List;

src/main/java/com/bl/binary_search/README.md renamed to src/main/java/com/borrelunde/leetcodesolutions/binary_search/README.md

@@ -1,4 +1,4 @@
-package com.bl.integer_to_roman;
+package com.borrelunde.leetcodesolutions.integer_to_roman;
 
 /**
  * This is the solution to the LeetCode problem: 12. Integer to Roman

src/main/java/com/bl/binary_search/Solution.java renamed to src/main/java/com/borrelunde/leetcodesolutions/binary_search/Solution.java

@@ -1,4 +1,4 @@
-package com.bl.median_of_two_sorted_arrays;
+package com.borrelunde.leetcodesolutions.median_of_two_sorted_arrays;
 
 /**
  * This is the solution to the LeetCode problem: 4. Median of Two Sorted Arrays

src/main/java/com/bl/fibonacci_number/README.md renamed to src/main/java/com/borrelunde/leetcodesolutions/fibonacci_number/README.md

@@ -1,4 +1,4 @@
-package com.bl.palindrome_number;
+package com.borrelunde.leetcodesolutions.palindrome_number;
 
 /**
  * This is the solution to the LeetCode problem: 9. Palindrome Number

src/main/java/com/bl/fibonacci_number/Solution.java renamed to src/main/java/com/borrelunde/leetcodesolutions/fibonacci_number/Solution.java

@@ -1,4 +1,4 @@
-package com.bl.roman_to_integer;
+package com.borrelunde.leetcodesolutions.roman_to_integer;
 
 import java.util.HashMap;
 import java.util.Map;

src/main/java/com/bl/integer_to_roman/README.md renamed to src/main/java/com/borrelunde/leetcodesolutions/integer_to_roman/README.md

@@ -1,4 +1,4 @@
-package com.bl.string_to_integer_atoi;
+package com.borrelunde.leetcodesolutions.string_to_integer_atoi;
 
 /**
  * This is the solution to the LeetCode problem: 8. String to Integer (atoi)

src/main/java/com/bl/integer_to_roman/Solution.java renamed to src/main/java/com/borrelunde/leetcodesolutions/integer_to_roman/Solution.java

@@ -1,9 +1,9 @@
-package com.bl.add_two_numbers;
+package com.borrelunde.leetcodesolutions.add_two_numbers;
 
 import org.junit.jupiter.api.DisplayName;
 import org.junit.jupiter.api.Test;
 
-import static org.junit.jupiter.api.Assertions.*;
+import static org.junit.jupiter.api.Assertions.assertEquals;
 
 /**
  * This is the test to the LeetCode problem: 2. Add Two Numbers

src/main/java/com/bl/median_of_two_sorted_arrays/README.md renamed to src/main/java/com/borrelunde/leetcodesolutions/median_of_two_sorted_arrays/README.md

@@ -1,4 +1,4 @@
-package com.bl.binary_search;
+package com.borrelunde.leetcodesolutions.binary_search;
 
 import org.junit.jupiter.api.DisplayName;
 import org.junit.jupiter.api.Test;

src/main/java/com/bl/median_of_two_sorted_arrays/Solution.java renamed to src/main/java/com/borrelunde/leetcodesolutions/median_of_two_sorted_arrays/Solution.java

@@ -1,4 +1,4 @@
-package com.bl.fibonacci_number;
+package com.borrelunde.leetcodesolutions.fibonacci_number;
 
 import org.junit.jupiter.api.DisplayName;
 import org.junit.jupiter.api.Test;

src/main/java/com/bl/palindrome_number/README.md renamed to src/main/java/com/borrelunde/leetcodesolutions/palindrome_number/README.md

@@ -1,4 +1,4 @@
-package com.bl.integer_to_roman;
+package com.borrelunde.leetcodesolutions.integer_to_roman;
 
 import org.junit.jupiter.api.DisplayName;
 import org.junit.jupiter.api.Test;

src/main/java/com/bl/palindrome_number/Solution.java renamed to src/main/java/com/borrelunde/leetcodesolutions/palindrome_number/Solution.java

@@ -1,4 +1,4 @@
-package com.bl.median_of_two_sorted_arrays;
+package com.borrelunde.leetcodesolutions.median_of_two_sorted_arrays;
 
 import org.junit.jupiter.api.DisplayName;
 import org.junit.jupiter.api.Test;

src/main/java/com/bl/roman_to_integer/README.md renamed to src/main/java/com/borrelunde/leetcodesolutions/roman_to_integer/README.md

@@ -1,4 +1,4 @@
-package com.bl.palindrome_number;
+package com.borrelunde.leetcodesolutions.palindrome_number;
 
 import org.junit.jupiter.api.DisplayName;
 import org.junit.jupiter.api.Test;

src/main/java/com/bl/roman_to_integer/Solution.java renamed to src/main/java/com/borrelunde/leetcodesolutions/roman_to_integer/Solution.java

@@ -1,4 +1,4 @@
-package com.bl.roman_to_integer;
+package com.borrelunde.leetcodesolutions.roman_to_integer;
 
 import org.junit.jupiter.api.DisplayName;
 import org.junit.jupiter.api.Test;

src/main/java/com/bl/string_to_integer_atoi/README.md renamed to src/main/java/com/borrelunde/leetcodesolutions/string_to_integer_atoi/README.md

@@ -1,4 +1,4 @@
-package com.bl.string_to_integer_atoi;
+package com.borrelunde.leetcodesolutions.string_to_integer_atoi;
 
 import org.junit.jupiter.api.DisplayName;
 import org.junit.jupiter.api.Test;