Skip to content

[sora0319] Week4 Solutions #1831

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 6 commits into from
Aug 17, 2025
Merged

[sora0319] Week4 Solutions #1831

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
6 commits
Select commit Hold shift + click to select a range
17ab781
solve maximum depth of binary tree
sora0319 Aug 16, 2025
f0fe90e
solve merge two sorted lists
sora0319 Aug 16, 2025
0f5561c
solve ifnd minimum in rotated sorted array
sora0319 Aug 16, 2025
c1a1072
solve coin change
sora0319 Aug 16, 2025
157b4d5
solve word search
sora0319 Aug 16, 2025
3a901db
solve 2 weeks problems
sora0319 Aug 16, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
1 change: 1 addition & 0 deletions 3sum/sora0319.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -35,3 +35,4 @@ public List<List<Integer>> threeSum(int[] nums) {
}
}


1 change: 1 addition & 0 deletions coin-change/sora0319.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -19,3 +19,4 @@ public int coinChange(int[] coins, int amount) {
}



1 change: 1 addition & 0 deletions find-minimum-in-rotated-sorted-array/sora0319.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -19,3 +19,4 @@ public int findMin(int[] nums) {
}
}


1 change: 1 addition & 0 deletions maximum-depth-of-binary-tree/sora0319.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -8,3 +8,4 @@ public int maxDepth(TreeNode root) {
}
}


2 changes: 1 addition & 1 deletion merge-two-sorted-lists/sora0319.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,5 +1,4 @@
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
Expand Down Expand Up @@ -38,3 +37,4 @@ public ListNode mergeTwoLists(ListNode list1, ListNode list2) {
}
}


1 change: 1 addition & 0 deletions product-of-array-except-self/sora0319.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -19,3 +19,4 @@ public int[] productExceptSelf(int[] nums) {
}
}


1 change: 1 addition & 0 deletions validate-binary-search-tree/sora0319.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -11,3 +11,4 @@ public boolean isvalid(TreeNode root,long min,long max)
}
}


1 change: 1 addition & 0 deletions word-search/sora0319.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -40,3 +40,4 @@ public boolean checkingWord(char[][] board, String word, boolean[][] visited, in
}
}