Commitc1aaff3

authored

Merge pull requestneetcode-gh#2439 from tayyabferozi/main

2 parents86e72f5 +88ea0f2 commitc1aaff3Copy full SHA for c1aaff3

File tree

+69

-1

lines changed

+69

-1

lines changed

Lines changed: 42 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -1,5 +1,5 @@`
`1`	`1`	`/**`
`2`		`- * Set - Frequency Counter`
	`2`	`+ * Set - Frequency Counter \| Using sort`
`3`	`3`	`* Time O(NlogN) \| Space O(N)`
`4`	`4`	`* https://leetcode.com/problems/top-k-frequent-elements/`
`5`	`5`	`*@param {number[]} nums`
`@@ -22,3 +22,44 @@ var topKFrequent = function(nums, k) {`
`22`	`22`	`}`
`23`	`23`	`returnoutput;`
`24`	`24`	`};`
	`25`	`+`
	`26`	`+/**`
	`27`	`+ * Without Sort`
	`28`	`+ * Time O(N) \| Space O(k)`
	`29`	`+ * https://leetcode.com/problems/top-k-frequent-elements/`
	`30`	`+ *@param {number[]} nums`
	`31`	`+ *@param {number} k`
	`32`	`+ *@return {number[]}`
	`33`	`+ */`
	`34`	`+`
	`35`	`+vartopKFrequent=function(nums,k){`
	`36`	`+constmp=newMap();`
	`37`	`+constarr=newArray(nums.length+1).fill(0);`
	`38`	`+constans=[];`
	`39`	`+`
	`40`	`+nums.forEach(el=>{`
	`41`	`+constval=mp.get(el)\|\|0;`
	`42`	`+mp.set(el,val+1);`
	`43`	`+});`
	`44`	`+`
	`45`	`+for(let[key,value]ofmp){`
	`46`	`+constprev=arr[value]\|\|[];`
	`47`	`+prev.push(key);`
	`48`	`+arr[value]=prev;`
	`49`	`+}`
	`50`	`+`
	`51`	`+`
	`52`	`+arr.reverse();`
	`53`	`+for(letelofarr){`
	`54`	`+if(k<1)break;`
	`55`	`+if(el){`
	`56`	`+for(letel2ofel){`
	`57`	`+if(k<1)break;`
	`58`	`+ans.push(el2);`
	`59`	`+k--;`
	`60`	`+}`
	`61`	`+}`
	`62`	`+}`
	`63`	`+`
	`64`	`+returnans;`
	`65`	`+};`

Lines changed: 27 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,3 +1,30 @@`
	`1`	`+/**`
	`2`	`+ * https://leetcode.com/problems/longest-repeating-character-replacement/`
	`3`	`+ * Time O(((N + 26) * N) * (M - N)) \| Space O(1)`
	`4`	`+ *@param {string} s`
	`5`	`+ *@param {number} k`
	`6`	`+ *@return {number}`
	`7`	`+ */`
	`8`	`+varcharacterReplacement=function(s,k){`
	`9`	`+letres=0;`
	`10`	`+letcount=newMap();`
	`11`	`+letl=0;`
	`12`	`+`
	`13`	`+for(letr=0;r<s.length;r++){`
	`14`	`+letlen=r-l+1`
	`15`	`+count.set(s[r],1+(count.get(s[r])\|\|0))`
	`16`	`+`
	`17`	`+if((len-Math.max(...count.values()))>k){`
	`18`	`+count.set(s[l],count.get(s[l])-1)`
	`19`	`+l++;`
	`20`	`+}`
	`21`	`+len=r-l+1;`
	`22`	`+res=Math.max(res,len)`
	`23`	`+}`
	`24`	`+`
	`25`	`+returnres;`
	`26`	`+};`
	`27`	`+`
`1`	`28`	`/**`
`2`	`29`	`* https://leetcode.com/problems/longest-repeating-character-replacement/`
`3`	`30`	`* Time O(((N + 26) * N) * (M - N)) \| Space O(1)`

Comments

(0)