Skip to content

Commit b1a80d6

Browse files
Zanger67Zanger67
committed
Updated old files to remove the commented link I would originally place at the top
1 parent 98f8e52 commit b1a80d6

File tree

491 files changed

+346
-1587
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

491 files changed

+346
-1587
lines changed

‎.Readme Updater

‎README.md

+2
Original file line numberDiff line numberDiff line change
@@ -151,6 +151,7 @@ Profile: [Zanger](https://leetcode.com/u/Zanger/)
151151
| 695 | [Max Area of Island](<https://leetcode.com/problems/max-area-of-island>) | Medium | N150 | [solution](<markdowns/_695. Max Area of Island.md>) | c |
152152
| 707 | [Design Linked List](<https://leetcode.com/problems/design-linked-list>) | Medium | | [solution](<markdowns/_707. Design Linked List.md>) | java |
153153
| 708 | [Insert into a Sorted Circular Linked List](<https://leetcode.com/problems/insert-into-a-sorted-circular-linked-list>) | Medium | | [solution](<markdowns/_708. Insert into a Sorted Circular Linked List.md>) | py |
154+
| 713 | [Subarray Product Less Than K](<https://leetcode.com/problems/subarray-product-less-than-k>) | Medium | | [solution](<markdowns/_713. Subarray Product Less Than K.md>) | py |
154155
| 720 | [Longest Word in Dictionary](<https://leetcode.com/problems/longest-word-in-dictionary>) | Medium | | [solution](<markdowns/_720. Longest Word in Dictionary.md>) | py |
155156
| 725 | [Split Linked List in Parts](<https://leetcode.com/problems/split-linked-list-in-parts>) | Medium | | [solution](<markdowns/_725. Split Linked List in Parts.md>) | py |
156157
| 739 | [Daily Temperatures](<https://leetcode.com/problems/daily-temperatures>) | Medium | N150 | [solution](<markdowns/_739. Daily Temperatures.md>) | java, c, py |
@@ -258,6 +259,7 @@ Profile: [Zanger](https://leetcode.com/u/Zanger/)
258259
| 1748 | [Sum of Unique Elements](<https://leetcode.com/problems/sum-of-unique-elements>) | Easy | | [solution](<markdowns/_1748. Sum of Unique Elements.md>) | c |
259260
| 1759 | [Count Number of Homogenous Substrings](<https://leetcode.com/problems/count-number-of-homogenous-substrings>) | Medium | | [solution](<markdowns/_1759. Count Number of Homogenous Substrings.md>) | java, c |
260261
| 1762 | [Buildings With an Ocean View](<https://leetcode.com/problems/buildings-with-an-ocean-view>) | Medium | | [solution](<markdowns/_1762. Buildings With an Ocean View.md>) | py |
262+
| 1768 | [Merge Strings Alternately](<https://leetcode.com/problems/merge-strings-alternately>) | Easy | | [solution](<markdowns/_1768. Merge Strings Alternately.md>) | java |
261263
| 1783 | [Grand Slam Titles](<https://leetcode.com/problems/grand-slam-titles>) | Medium | | [solution](<markdowns/_1783. Grand Slam Titles.md>) | sql |
262264
| 1791 | [Find Center of Star Graph](<https://leetcode.com/problems/find-center-of-star-graph>) | Easy | Daily | [solution](<markdowns/_1791. Find Center of Star Graph.md>) | py, cpp, c, java |
263265
| 1804 | [Implement Trie II (Prefix Tree)](<https://leetcode.com/problems/implement-trie-ii-prefix-tree>) | Medium | | [solution](<markdowns/_1804. Implement Trie II (Prefix Tree).md>) | py |

‎markdowns/_1. Two Sum.md

+1-7
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
*First added: May 22, 2024*
44

5-
*First added: May 31, 2024*
5+
*First added: July 01, 2024*
66

77

88
> *To see the question prompt, click the title.*
@@ -20,7 +20,6 @@
2020
### Java
2121
#### [e1 - brute force.java](<../my-submissions/e1 - brute force.java>)
2222
```Java
23-
// https://leetcode.com/problems/two-sum/description/
2423
// Slow and O(n^2)
2524

2625
// See alternative OTHER for hashmap solution
@@ -42,9 +41,6 @@ class Solution {
4241

4342
#### [e1.java](<../my-submissions/e1.java>)
4443
```Java
45-
// https://leetcode.com/problems/two-sum/
46-
47-
4844
class Solution {
4945
public int[] twoSum(int[] nums, int target) {
5046
if (nums.length == 2) {
@@ -70,8 +66,6 @@ class Solution {
7066
### Python
7167
#### [e1.py](<../my-submissions/e1.py>)
7268
```Python
73-
# https://leetcode.com/problems/two-sum/
74-
7569
class Solution:
7670
def twoSum(self, nums: List[int], target: int) -> List[int]:
7771
if len(nums) == 2 :

‎markdowns/_1002. Find Common Characters.md

+1-4
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
*First added: June 04, 2024*
44

5-
*First added: June 04, 2024*
5+
*First added: July 01, 2024*
66

77

88
> *To see the question prompt, click the title.*
@@ -18,10 +18,7 @@
1818
### Python
1919
#### [e1002 Daily.py](<../my-submissions/e1002 Daily.py>)
2020
```Python
21-
# https://leetcode.com/problems/find-common-characters/description/?envType=daily-question&envId=2024-06-05
22-
2321
# Daily
24-
2522
# Doing this with bad wifi so I can barely submit so idc about efficiency lol
2623

2724

‎markdowns/_1006. Clumsy Factorial.md

+1-6
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
*First added: June 11, 2024*
44

5-
*First added: June 11, 2024*
5+
*First added: July 01, 2024*
66

77

88
> *To see the question prompt, click the title.*
@@ -19,8 +19,6 @@
1919
### C
2020
#### [m1006.c](<../my-submissions/m1006.c>)
2121
```C
22-
// https://leetcode.com/problems/clumsy-factorial/description/
23-
2422
int clumsy(int n) {
2523
switch (n) {
2624
case 4 :
@@ -50,9 +48,6 @@ int clumsy(int n) {
5048
### Python
5149
#### [m1006.py](<../my-submissions/m1006.py>)
5250
```Python
53-
# https://leetcode.com/problems/clumsy-factorial/description/
54-
55-
5651
class Solution:
5752
def clumsy(self, n: int) -> int:
5853
match n :

‎markdowns/_1030. Matrix Cells in Distance Order.md

+1-3
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
*First added: June 03, 2024*
44

5-
*First added: June 03, 2024*
5+
*First added: July 01, 2024*
66

77

88
> *To see the question prompt, click the title.*
@@ -18,8 +18,6 @@
1818
### Python
1919
#### [e1030.py](<../my-submissions/e1030.py>)
2020
```Python
21-
# https://leetcode.com/problems/matrix-cells-in-distance-order/
22-
2321
# I'm sorry this is just funny to me lol
2422

2523
class Solution:

‎markdowns/_1046. Last Stone Weight.md

+1-3
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
*First added: June 03, 2024*
44

5-
*First added: June 03, 2024*
5+
*First added: July 01, 2024*
66

77

88
> *To see the question prompt, click the title.*
@@ -18,8 +18,6 @@
1818
### Python
1919
#### [e1046.py](<../my-submissions/e1046.py>)
2020
```Python
21-
# https://leetcode.com/problems/last-stone-weight/description/
22-
2321
class Solution:
2422
def lastStoneWeight(self, stones: List[int]) -> int:
2523
stoneCount = len(stones)

‎markdowns/_1051. Height Checker.md

+1-7
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
*First added: June 09, 2024*
44

5-
*First added: June 09, 2024*
5+
*First added: July 01, 2024*
66

77

88
> *To see the question prompt, click the title.*
@@ -19,9 +19,6 @@
1919
### C
2020
#### [e1051 Daily.c](<../my-submissions/e1051 Daily.c>)
2121
```C
22-
// https://leetcode.com/problems/height-checker/description/
23-
24-
2522
int compareHelper(const void* a, const void* b) {
2623
return *((int*) a) - *((int*) b);
2724
}
@@ -46,9 +43,6 @@ int heightChecker(int* heights, int heightsSize) {
4643
### Python
4744
#### [e1051.py](<../my-submissions/e1051.py>)
4845
```Python
49-
# https://leetcode.com/problems/height-checker/description/
50-
51-
5246
class Solution:
5347
def heightChecker(self, heights: List[int]) -> int:
5448
sortedHeights = sorted(heights)

‎markdowns/_1068. Product Sales Analysis I.md

+1-4
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
*First added: May 22, 2024*
44

5-
*First added: May 22, 2024*
5+
*First added: July 01, 2024*
66

77

88
> *To see the question prompt, click the title.*
@@ -18,9 +18,6 @@
1818
### SQL
1919
#### [e1068.sql](<../my-submissions/e1068.sql>)
2020
```SQL
21-
# https://leetcode.com/problems/product-sales-analysis-i/description/
22-
23-
2421
SELECT
2522
product_name,
2623
year,

‎markdowns/_111. Minimum Depth of Binary Tree.md

+1-3
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
*First added: June 07, 2024*
44

5-
*First added: June 07, 2024*
5+
*First added: July 01, 2024*
66

77

88
> *To see the question prompt, click the title.*
@@ -18,8 +18,6 @@
1818
### C
1919
#### [e111.c](<../my-submissions/e111.c>)
2020
```C
21-
// https://leetcode.com/problems/minimum-depth-of-binary-tree/
22-
2321
/**
2422
* Definition for a binary tree node.
2523
* struct TreeNode {

‎markdowns/_1122. Relative Sort Array.md

+1-5
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
*First added: June 10, 2024*
44

5-
*First added: June 10, 2024*
5+
*First added: July 01, 2024*
66

77

88
> *To see the question prompt, click the title.*
@@ -19,8 +19,6 @@
1919
### Python
2020
#### [e1122 Daily.py](<../my-submissions/e1122 Daily.py>)
2121
```Python
22-
# https://leetcode.com/problems/relative-sort-array/description/?envType=daily-question&envId=2024-06-11
23-
2422
class Solution:
2523
def relativeSortArray(self, arr1: List[int], arr2: List[int]) -> List[int]:
2624
cnt = Counter(arr1)
@@ -41,8 +39,6 @@ class Solution:
4139
### Java
4240
#### [e1122.java](<../my-submissions/e1122.java>)
4341
```Java
44-
// https://leetcode.com/problems/relative-sort-array/description/?envType=daily-question&envId=2024-06-11
45-
4642
class Solution {
4743
public int[] relativeSortArray(int[] arr1, int[] arr2) {
4844
HashSet<Integer> arr2vals = new HashSet<>();

‎markdowns/_114. Flatten Binary Tree to Linked List.md

+1-7
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
*First added: June 10, 2024*
44

5-
*First added: June 10, 2024*
5+
*First added: July 01, 2024*
66

77

88
> *To see the question prompt, click the title.*
@@ -20,8 +20,6 @@
2020
### Python
2121
#### [m114 v1 Stack.py](<../my-submissions/m114 v1 Stack.py>)
2222
```Python
23-
# https://leetcode.com/problems/flatten-binary-tree-to-linked-list/description/
24-
2523
# Definition for a binary tree node.
2624
# class TreeNode:
2725
# def __init__(self, val=0, left=None, right=None):
@@ -50,8 +48,6 @@ class Solution:
5048
### C
5149
#### [m114 v2 O(1) Space Optimized.c](<../my-submissions/m114 v2 O(1) Space Optimized.c>)
5250
```C
53-
// https://leetcode.com/problems/flatten-binary-tree-to-linked-list/description/
54-
5551
// Simpler O(1) solution with a lottttt less if statements lol
5652

5753
/**
@@ -86,8 +82,6 @@ void flatten(struct TreeNode* root) {
8682
8783
#### [m114 v2 O(1) Space.c](<../my-submissions/m114 v2 O(1) Space.c>)
8884
```C
89-
// https://leetcode.com/problems/flatten-binary-tree-to-linked-list/description/
90-
9185
// O(1) space let's gooooo
9286
9387
/**

‎markdowns/_118. Pascal's Triangle.md

+1-4
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
*First added: May 22, 2024*
44

5-
*First added: May 22, 2024*
5+
*First added: July 01, 2024*
66

77

88
> *To see the question prompt, click the title.*
@@ -18,9 +18,6 @@
1818
### Python
1919
#### [e118.py](<../my-submissions/e118.py>)
2020
```Python
21-
# https://leetcode.com/problems/valid-triangle-number
22-
23-
2421
class Solution:
2522
def generate(self, numRows: int) -> List[List[int]]:
2623
self.output = []

‎markdowns/_1184. Distance Between Bus Stops.md

+1-3
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
*First added: May 31, 2024*
44

5-
*First added: May 31, 2024*
5+
*First added: July 01, 2024*
66

77

88
> *To see the question prompt, click the title.*
@@ -18,8 +18,6 @@
1818
### Python
1919
#### [e1184.py](<../my-submissions/e1184.py>)
2020
```Python
21-
# https://leetcode.com/problems/distance-between-bus-stops/
22-
2321
''' Notes
2422
A bit bulky but did it for the theoretical runtime savings. Still O(n) but
2523
can save on the additional calclations if one direction is significantly

‎markdowns/_1218. Longest Arithmetic Subsequence of Given Difference.md

+1-4
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
*First added: May 31, 2024*
44

5-
*First added: May 31, 2024*
5+
*First added: July 01, 2024*
66

77

88
> *To see the question prompt, click the title.*
@@ -18,9 +18,6 @@
1818
### Python
1919
#### [m1218.py](<../my-submissions/m1218.py>)
2020
```Python
21-
# https://leetcode.com/problems/longest-arithmetic-subsequence-of-given-difference/description/
22-
23-
2421
# Solution is O(n) both space and time
2522
class Solution:
2623
def longestSubsequence(self, arr: List[int], difference: int) -> int:

‎markdowns/_1249. Minimum Remove to Make Valid Parentheses.md

+1-3
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
*First added: June 10, 2024*
44

5-
*First added: June 10, 2024*
5+
*First added: July 01, 2024*
66

77

88
> *To see the question prompt, click the title.*
@@ -18,8 +18,6 @@
1818
### Python
1919
#### [m1249.py](<../my-submissions/m1249.py>)
2020
```Python
21-
# https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/description/
22-
2321
class Solution:
2422
def minRemoveToMakeValid(self, s: str) -> str:
2523
output = list(s)

‎markdowns/_125. Valid Palindrome.md

+1-5
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
*First added: June 07, 2024*
44

5-
*First added: June 07, 2024*
5+
*First added: July 01, 2024*
66

77

88
> *To see the question prompt, click the title.*
@@ -19,8 +19,6 @@
1919
### C
2020
#### [e125.c](<../my-submissions/e125.c>)
2121
```C
22-
// https://leetcode.com/problems/valid-palindrome/description/
23-
2422
bool isPalindrome(char* s) {
2523
int left = 0;
2624
int right = 0;
@@ -57,8 +55,6 @@ bool isPalindrome(char* s) {
5755
### Python
5856
#### [e125.py](<../my-submissions/e125.py>)
5957
```Python
60-
# https://leetcode.com/problems/valid-palindrome/description/
61-
6258
class Solution:
6359
def isPalindrome(self, s: str) -> bool:
6460
singleStr = re.sub('[^A-Za-z0-9]', '', s).lower()

‎markdowns/_1252. Cells with Odd Values in a Matrix.md

+1-6
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
*First added: June 04, 2024*
44

5-
*First added: June 04, 2024*
5+
*First added: July 01, 2024*
66

77

88
> *To see the question prompt, click the title.*
@@ -19,8 +19,6 @@
1919
### C
2020
#### [e1252 v2 bools.c](<../my-submissions/e1252 v2 bools.c>)
2121
```C
22-
// https://leetcode.com/problems/cells-with-odd-values-in-a-matrix/description/
23-
2422
// Swapped to using bools but for some reason it's slower than ints hm
2523
// Memory is also worse oddly
2624

@@ -66,9 +64,6 @@ int oddCells(int m, int n, int** indices, int indicesSize, int* indicesColSize)
6664
6765
#### [e1252.c](<../my-submissions/e1252.c>)
6866
```C
69-
// https://leetcode.com/problems/cells-with-odd-values-in-a-matrix/description/
70-
71-
7267
// Lot of loops but eh ill swap it around with bools
7368
7469

0 commit comments

Comments
 (0)