Uh oh!
There was an error while loading.Please reload this page.
- Notifications
You must be signed in to change notification settings - Fork5.7k
Slid wind#1293
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 ourterms of service andprivacy statement. We’ll occasionally send you account related emails.
Already on GitHub?Sign in to your account
Open
Ramzi-Abidi wants to merge6 commits intoTheAlgorithms:masterChoose a base branch
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.
Uh oh!
There was an error while loading.Please reload this page.
Open
Slid wind#1293
Changes fromall commits
Commits
Show all changes
6 commits Select commitHold shift + click to select a range
c4819fc adding sliding window problem(fruitsIntoBasket)
Ramzi-Abidib4c0075 adding sliding window problem(fruitsIntoBasket)
Ramzi-Abidiac93811 adding more test cases and comments
Ramzi-Abidi6d51c50 adding comments to the algo
Ramzi-Abidi25ae758 adding comments to the algo
Ramzi-Abidi01e06f5 adding comments to the algo, coorecting spelling errors
Ramzi-AbidiFile filter
Filter by extension
Conversations
Failed to load comments.
Loading
Uh oh!
There was an error while loading.Please reload this page.
Jump to
Jump to file
Failed to load files.
Loading
Uh oh!
There was an error while loading.Please reload this page.
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,46 @@ | ||
| /** | ||
| * @function totalFruit | ||
| * @param {number[]} arr | ||
| * @return {number} res | ||
| * @see https://leetcode.com/problems/fruit-into-baskets/ | ||
| * @see [sliding-window-technique] (https://www.geeksforgeeks.org/window-sliding-technique/) | ||
| */ | ||
| export const totalFruit = function (arr) { | ||
| // to maximize number of elements that our basket can have | ||
| let max = 0 | ||
| // keeps track of the occurrence of each element | ||
| const hash = {} | ||
| // left side of the window | ||
| let j = 0 | ||
| // to count number of elements | ||
| let objLength = 0 | ||
| for (let i = 0; i < arr.length; i++) { | ||
| // A hashmap keeps track of each character and it's occurrence | ||
| if (!hash[arr[i]]) { | ||
| hash[arr[i]] = 1 | ||
| // when we have a new element we increment objLength | ||
| objLength++ | ||
| } else { | ||
| hash[arr[i]]++ | ||
| } | ||
| if (objLength <= 2) { | ||
| // maximizing and opening the window | ||
| max = Math.max(max, i - j + 1) | ||
| } else { | ||
| // once we have more than two distinct elements in our hashmap, we should shrink our window | ||
| while (objLength > 2) { | ||
| hash[arr[j]]-- | ||
| // when the occurrence of an element becomes 0 we should delete it from the hashmap | ||
| if (hash[arr[j]] === 0) { | ||
| delete hash[arr[j]] | ||
| objLength-- | ||
| } | ||
| j++ | ||
| } | ||
| } | ||
| } | ||
| return max | ||
| } |
9 changes: 9 additions & 0 deletionsDynamic-Programming/Sliding-Window/test/FruitsIntoBasket.test.js
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,9 @@ | ||
| import { totalFruit } from '../FruitsIntoBasket' | ||
| test('result : ', () => { | ||
| expect(totalFruit([3, 3, 3, 1, 2, 1, 1, 2, 3, 3, 4])).toStrictEqual(5) | ||
| expect(totalFruit([5, 3, 3, 1, 2])).toStrictEqual(3) | ||
| expect(totalFruit([9, 1, 2, 2, 2])).toStrictEqual(4) | ||
| expect(totalFruit([3, 3, 3])).toStrictEqual(3) | ||
| expect(totalFruit([])).toStrictEqual(0) | ||
| }) |
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.