-
-
Notifications
You must be signed in to change notification settings - Fork 195
Evan: Week 5 #101
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.
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
Evan: Week 5 #101
Changes from 2 commits
Commits
Show all changes
6 commits
Select commit
Hold shift + click to select a range
44eaaa6
solve: 3sum
sounmind 35b3b15
solve: top K frequent elements
sounmind af6c80a
solve: product of array except self
sounmind 7b021d0
docs: add complexities
sounmind 0a44499
solve: encode and decode strings
sounmind f634742
solve: longest consecutive sequence
sounmind File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,49 @@ | ||
/** | ||
* @param {number[]} nums | ||
* @return {number[][]} | ||
*/ | ||
var threeSum = function (nums) { | ||
const sorted = nums.sort((a, b) => a - b); | ||
const result = []; | ||
|
||
for (let i = 0; i < sorted.length; i++) { | ||
const fixedNumber = sorted[i]; | ||
const previousFixedNumber = sorted[i - 1]; | ||
|
||
if (fixedNumber === previousFixedNumber) { | ||
continue; | ||
} | ||
|
||
let [leftEnd, rightEnd] = [i + 1, sorted.length - 1]; | ||
|
||
while (leftEnd < rightEnd) { | ||
const sum = fixedNumber + sorted[leftEnd] + sorted[rightEnd]; | ||
|
||
if (sum === 0) { | ||
result.push([sorted[leftEnd], sorted[rightEnd], sorted[i]]); | ||
|
||
while ( | ||
sorted[leftEnd + 1] === sorted[leftEnd] || | ||
sorted[rightEnd - 1] === sorted[rightEnd] | ||
) { | ||
if (sorted[leftEnd + 1] === sorted[leftEnd]) { | ||
leftEnd += 1; | ||
} | ||
|
||
if (sorted[rightEnd - 1] === sorted[rightEnd]) { | ||
rightEnd -= 1; | ||
} | ||
} | ||
|
||
leftEnd += 1; | ||
rightEnd -= 1; | ||
} else if (sum < 0) { | ||
leftEnd += 1; | ||
} else { | ||
rightEnd -= 1; | ||
} | ||
} | ||
} | ||
|
||
return result; | ||
}; |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,22 @@ | ||
/** | ||
* @param {number[]} nums | ||
* @param {number} k | ||
* @return {number[]} | ||
*/ | ||
var topKFrequent = function (nums, k) { | ||
const counter = new Map(); | ||
|
||
nums.forEach((num) => { | ||
if (counter.has(num)) { | ||
counter.set(num, counter.get(num) + 1); | ||
} else { | ||
counter.set(num, 1); | ||
} | ||
}); | ||
|
||
const sorted = [...counter.entries()].sort( | ||
([, freqA], [, freqB]) => freqB - freqA | ||
); | ||
|
||
return sorted.slice(0, k).map(([num]) => num); | ||
}; |
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
μ΄λ κ² λ³μλͺ μ μ°λκΉ λ λͺ ννκ² μ½λκ° μ½νλ€μ!