Skip to content

Update 1143, 252, 42 #365

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 13 commits into from
Jul 24, 2022
Merged

Update 1143, 252, 42 #365

Changes from 1 commit
Commits
Show all changes
13 commits
Select commit Hold shift + click to select a range
4853ee0
Add 1143 Longest Common Subsequence
miladra Jul 6, 2022
067ab73
Delete 1143 beacuse It has conflict
miladra Jul 6, 2022
7252a1b
Merge branch 'neetcode-gh:main' into main
miladra Jul 6, 2022
bbf6afa
Add Itrative version of Longest Common Subsequence
miladra Jul 6, 2022
27b55ed
Add 252 meeting rooms
miladra Jul 7, 2022
baf691d
Add another approach fot meeting rooms
miladra Jul 7, 2022
da25527
Update 42 trapping rain water with O(1) space
miladra Jul 11, 2022
057f985
Merge branch 'neetcode-gh:main' into main
miladra Jul 11, 2022
84f910e
Merge branch 'neetcode-gh:main' into main
miladra Jul 19, 2022
d5ee058
Update 1143-Longest-Common-Subsequence.java
mitchellirvin Jul 23, 2022
58c5a13
Merge branch 'neetcode-gh:main' into main
miladra Jul 24, 2022
82957fd
Merge branch 'neetcode-gh:main' into main
miladra Jul 24, 2022
e571a70
Fix meeting rooms
miladra Jul 24, 2022
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
Prev Previous commit
Next Next commit
Update 1143-Longest-Common-Subsequence.java
  • Loading branch information
@mitchellirvin
mitchellirvin authored Jul 23, 2022
commit d5ee058bda35be5dee098da94f6da28cf52b2972
2 changes: 1 addition & 1 deletion java/1143-Longest-Common-Subsequence.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -19,7 +19,7 @@ public int LCS(String s1, String s2, int i, int j, int[][] dp) {
}


// Itrative version
// Iterative version
class Solution {
public int longestCommonSubsequence(String text1, String text2) {
//O(n*m)/O(n*m) time/memory
Expand Down