solves base 7

Author: anishLearnsToCode

Diff for: README.md

@@ -132,8 +132,8 @@
 | 492 | [Construct the Rectangle](https://leetcode.com/problems/construct-the-rectangle) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/ConstructTheRectangle.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/construct_the_rectangle.py) |
 | 496 | [Next Greater Element I](https://leetcode.com/problems/next-greater-element-i) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/NextGreaterElementI.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/next_greater_element_i.py) |
 | 500 | [Keyboard Row](https://leetcode.com/problems/keyboard-row) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/KeyBoardRow.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/keyboard_row.py) |
-| 501 | [Find Mode in Binary Search Tree](https://leetcode.com/problems/find-mode-in-binary-search-tree) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/FindModeInBinarySearchTree) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/find_mode_in_binary_search_tree.py) |
-| 504 | [Base 7](https://leetcode.com/problems/base-7) | Easy | |
+| 501 | [Find Mode in Binary Search Tree](https://leetcode.com/problems/find-mode-in-binary-search-tree) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/FindModeInBinarySearchTree.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/find_mode_in_binary_search_tree.py) |
+| 504 | [Base 7](https://leetcode.com/problems/base-7) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/Base7.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/base_7.py) |
 | 506 | [Relative Ranks](https://leetcode.com/problems/relative-ranks) | Easy | |
 | 507 | [Perfect Number](https://leetcode.com/problems/perfect-number) | Easy | |
 | 509 | [Fibonacci Number](https://leetcode.com/problems/fibonacci-number) | Easy | |

Diff for: python/base_7.py

@@ -0,0 +1,11 @@
+class Solution:
+    def convertToBase7(self, num: int) -> str:
+        if num == 0:
+            return '0'
+        is_negative = num < 0
+        num = -num if is_negative else num
+        result = ''
+        while num > 0:
+            result = str(num % 7) + result
+            num //= 7
+        return ('-' if is_negative else '') +  result

Diff for: src/Base7.java

@@ -0,0 +1,19 @@
+public class Base7 {
+    public static String convertToBase7(int number) {
+        if (number == 0) return "0";
+        StringBuilder result = new StringBuilder();
+        boolean isNegative = number < 0;
+        if (isNegative) {
+            number *= -1;
+        }
+        while (number > 0) {
+            result.append(number % 7);
+            number /= 7;
+        }
+        return result.append(isNegative ? "-" : "").reverse().toString();
+    }
+
+    public static void main(String[] args) {
+        System.out.println(convertToBase7(-7));
+    }
+}