formatting and added 146 submitted and stats

Author: rustykitty

0001-two-sum.py

@@ -5,10 +5,8 @@
 
 Runtime: 0 ms (beats 100.00%)
 Memory: 17.98 MB (beats 14.36%)
-
 """
 
-
 class Solution:
     def twoSum(self, nums: List[int], target: int) -> List[int]:
         d = {}

0009-palindrome-number.cpp

@@ -5,7 +5,6 @@ Submitted: October 30, 2024
 
 Runtime: 4 ms (beats 35.53%)
 Memory: 8.51 MB (beats 39.93%)
-
 */
 
 class Solution {
@@ -23,4 +22,4 @@ class Solution {
         // should equal if they are palindrome
         return x == y;
     }
-};
+};

0014-longest-common-prefix.c

@@ -6,7 +6,6 @@ This solution: November 25, 2024
 
 Runtime: 0 ms (beats 100.00%)
 Memory: 8.03 MB (beats 55.00%)
-
 */
 
 char* longestCommonPrefix(char** strs, int strsSize) {
@@ -29,4 +28,4 @@ char* longestCommonPrefix(char** strs, int strsSize) {
         prefix[i] = strs[0][i];
     }
     return prefix;
-}
+}

0014-longest-common-prefix.cpp

@@ -6,7 +6,6 @@ This solution: November 24, 2024
 
 Runtime: 0 ms (beats 100.00%)
 Memory: 11.06 MB (beats 91.10%)
-
 */
 
 class Solution {
@@ -28,4 +27,4 @@ class Solution {
         }
         return prefix;
     }
-};
+};

0014-longest-common-prefix.py

@@ -6,7 +6,6 @@
 
 Runtime: 37 ms (beats 5.20%)
 Memory: 16.77 MB (beats 20.04%)
-
 """
 
 class Solution:
@@ -19,4 +18,4 @@ def longestCommonPrefix(self, strs: List[str]) -> str:
                 prefix += items[0]
             else:
                 return prefix
-        return prefix
+        return prefix

0020-valid-parentheses.cpp

@@ -6,7 +6,6 @@ This solution: November 25, 2024
 
 Runtime: 0 ms (beats 100.00%)
 Memory: 7.90 MB (beats 74.91%)
-
 */
 
 class Solution {
@@ -28,4 +27,4 @@ class Solution {
         }
         return stack.empty();
     }
-};
+};

0066-plus-one-alternative.py

@@ -5,7 +5,6 @@
 
 Runtime: 41 ms (beats 5.16%)
 Memory: 16.52 MB (63.84%)
-
 """
 
 class Solution:

0066-plus-one.py

@@ -6,7 +6,6 @@
 
 Runtime: 41 ms (beats 5.16%)
 Memory: 16.52 MB (63.84%)
-
 """
 
 class Solution:
@@ -16,4 +15,4 @@ def plusOne(self, digits: List[int]) -> List[int]:
         if digits[-1] == 9:
             return self.plusOne(digits[:-1]) + [0] # carry
         digits[-1] += 1 # if no carry, just add one
-        return digits
+        return digits

0146-lru-cache.cpp

@@ -1,11 +1,12 @@
 /*
 146. LRU Cache
 
+Submitted: November 27, 2024
 
+Runtime: 81 ms (beats 66.53%)
+Memory: 182.14 MB (beats 24.43%)
 */
 
-// note: semi-realistic implementation
-
 class LinkedList {
 public:
     struct Node {
@@ -91,4 +92,4 @@ class LRUCache {
  * LRUCache* obj = new LRUCache(capacity);
  * int param_1 = obj->get(key);
  * obj->put(key,value);
- */
+ */

0171-excel-sheet-column-number-alternative.cpp

@@ -5,7 +5,6 @@ Submitted: October 4, 2024
 
 Runtime: 0 ms (beats 100.00%)
 Memory: 8.76 MB (beats 31.86%)
-
 */
 
 class Solution {
@@ -19,4 +18,4 @@ class Solution {
         }
         return res;
     }
-};
+};