-
Notifications
You must be signed in to change notification settings - Fork 1.3k
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
added two js solutions. problems 3016 && 3175 #194
Open
sambabib
wants to merge
10
commits into
fishercoder1534:master
Choose a base branch
from
sambabib:sambabib-js-solutions
base: master
Could not load branches
Branch not found: {{ refName }}
Loading
Could not load tags
Nothing to show
Loading
Are you sure you want to change the base?
Some commits from the old base branch may be removed from the timeline,
and old review comments may become outdated.
Open
Changes from 8 commits
Commits
Show all changes
10 commits
Select commit
Hold shift + click to select a range
30ac3db
added js solution to _3
9447151
js solution to _17
4ca41ba
added js solution links to readme
daed7dc
updated links to js solutions
7a35db8
added js solution 994
83fdb18
added solution link to readme
b7dc87f
added js solutions to _3016 && _3175
f9b9b6c
Merge branch 'master' into sambabib-js-solutions
sambabib 423eb11
Revert changes to README.md
9bb4d73
Merge branch 'master' into sambabib-js-solutions
sambabib 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 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,24 @@ | ||
function minPushesToType(word) { | ||
let freqMap = new Map(); | ||
|
||
// Using greedy frequency-based allocation (this is basically gives pirority based on frequenecy of occurence.). | ||
// Count frequency of each letter. | ||
for (let char of word) { | ||
freqMap.set(char, (freqMap.get(char) || 0) + 1); | ||
} | ||
|
||
// Sort letters by frequency in descending order. | ||
let frequencies = Array.from(freqMap.values()).sort((a, b) => b - a); | ||
|
||
// Assign letters to keys 2-9. | ||
let keys = Array(8).fill(0); | ||
let totalPushes = 0; | ||
|
||
for (let i = 0; i < frequencies.length; i++) { | ||
let keyIndex = i % 8; | ||
let presses = Math.floor(i / 8) + 1; | ||
totalPushes += frequencies[i] * presses; | ||
} | ||
|
||
return totalPushes; | ||
} |
This file contains 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,25 @@ | ||
function findWinner(skills, k) { | ||
// This solution uses a queue to process the matches. | ||
let n = skills.length; | ||
let maxSkill = Math.max(...skills); | ||
let queue = []; | ||
|
||
let currentWinner = 0; | ||
let currentWins = 0; | ||
|
||
for (let i = 1; i < n; i++) { | ||
if (skills[currentWinner] > skills[i]) { | ||
currentWins++; | ||
} else { | ||
currentWinner = i; | ||
currentWins = 1; | ||
} | ||
|
||
// If the champion has won k times or is the max skill player, return. | ||
if (currentWins >= k || skills[currentWinner] === maxSkill) { | ||
return currentWinner; | ||
} | ||
} | ||
|
||
return currentWinner; | ||
} |
This file contains 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
Oops, something went wrong.
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.
Please remove unrelated changes in this PR.
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.
The changes from the .README was indentation misdirected on my part. I have resolved them now, if I haven't, please let me know what I am missing. Thanks