วีดีโอ

function test(nb, final) { for (let i = 0; i < nb.length; i++) { for (let j = i + 1; j < nb.length; j++) { if (nb[i] + nb[j] === final) { return [i, j]; } } } } console.log(test([2, 7, 11, 15], 9));

class Solution { /** * @param {string} s * @param {string} t * @return {boolean} */ isAnagram(s, t) { if(s.length !== t.length) return false; let map = {}; for(let i=0; i<t.length; i++){ map[s[i]] = !Boolean(map[s[i]]); map[t[i]] = !Boolean(map[t[i]]); } console.log(map) for(const key in map){ if(map[key] === true) return false } return true; } } Can anyone help me with the test case for which it is failing?

right++?? Come on man...

I think you wrote left++ and right++ part wrong, this algorithm would work in O(N) time whereas binary search is O(logN). You need to skip half of the remaining values each iteration to call it binary search, but you are skipping only 1 value each iteration.

Thanks for this explanation

This was the best explanation I could find about 3sum on youtube. Thank you for the effort

the solution gave an error says string.split isnt a function?

You the best bro 😃

this was really great

It’s in the if statement

Good Explanation ! I highly encourage you to continue to make videos !

if is o(n) but if plus else is o(n^2) no? don't we need to keep it o(n)?

Typo in the code. Not right++ right -

you need to update pointers too mid + 1, mid - 1. not just increment/decrement them

where is JSDev waiting for his video since 9 months

I didn’t check but at first glance, the bug is in line 16 - should be intervals[i][0]. Also I’m not sure if you need to take a min at line 17 since you already sorted the array

This is a great solution, but I would ask to add time and space complexity of this solution as well.

isnt the solution suppose to be [2,3] not [2,4] in your example of 1 2 3 4

How is this O(n) with the nested while loop? Is it because this would technically be O(n * m) where n is the length of nums and m is the longest possible sequence, and m will always be less than or equal to n so it's negligible to O(n) ? Couldn't this be O(n^2) if all numbers in nums are sequential? Am I close or way off?

very good explanation and solution thank you

Normally I like it when people type out the code while explaining it. But I actually found it being pre-written easier to wrap my heard around. Seeing you write out comments with the data structures and how they're built with the code right next to it made the concepts a breeze to understand. Thanks for making this video! It's one of the questions I struggled with for Blind75

how is s.length not throwing an error? isn't that a string? please explain

thank you so much for this and damn you have the best voice

Nice

why is it so difficult ? here is my solution var productExceptSelf = function(nums) { let result = []; for (let i =0; i < nums.length; i++) { result[i] = nums.reduce((acc, item, index) => { if (index !== i) { acc *= item } return acc }, 1) } return result };

this is what i needed!

0:25 [1,10,80,48] is not sorted even tho you say it is... 1:10 right-- instead of right++

would this approach work for two sum in general, not just sorted? I'll need to try for myself...but maybe?

Thank you so much :)

awesome explanation) thanks

function sortArrays(arr) { return arr.sort((a, b) => a[0] - b[0]); } function mergeIntervals(arr) { let newArr = [arr[0]]; for (const [start, end] of arr) { let lastEnd = newArr.at(-1)[1]; if (start <= lastEnd) { newArr.at(-1)[1] = Math.max(lastEnd, end); } else { newArr.push([start, end]); } } return newArr; } let sortedArr = sortArrays(arr); let result = mergeIntervals(sortedArr); console.log(result);

Very Nice explanation!

Amazing explanation !!

I dont get the l+1 and r+1 and you help me explain it a little bit more.

Nice helped me understand it, but when do you use 'less than/<' without <=?

Can someone plz help with the Time and Space complexity for this solution .. Thanks in Advance ..

Great video! Thank you!

Thank you! Very helpful video! Please continue to make more videos like this! I watched your solution and modified it a bit. It has less code, but I'm not sure if it is more efficient. Can I have your feedback, please? function topKFrequent(nums: number[], k: number): number[] { let count = {} for(const number of nums){ if(count[number] === undefined){ count[number] = 1 } else { count[number]++ } } const keysSorted = Object.keys(count).sort((a,b)=> count[b] - count[a]) return Array.from(keysSorted.slice(0, k), Number); };

I prefer an explanation of the approach first with no code, then showing the code afterward, so I can try to code it out on my own first and then look for mistakes I've made if I can't get it to work, or more efficient ways to do it. Regardless, thank you for this explanation! It helped me understand bucket sort much clearer than previous explanations so far.

live code and explaining is cool!

Cliffhanger ending

Shouldn't i = 0?

Your explanation of the solution is very good and understandable. Please keep making videos.

Great video explanation. Thank you!

Best video explenation I have seen for this problem. Time complexity and space would be a nice discussion as well.

FOR ANYONE TRYING TO USE ARRAY.FILL() INSTEAD OF A FOR LOOP TO FILL THE BUCKET: THIS IS WHY IT DOESN'T WORK I was so frustrated after basically copying this code, but thinking "oh, I can just use Array(nums.length + 1).fill([]) instead of iterating and adding an empty array, it'll be more concise", and it wouldn't work. I found after opening vscode and console logging some stuff that every array in my "bucket" was getting filled with each and every number. This is why: Array.fill() populates each index with the SAME element. If that element is an object/array, it is passed by reference, not value. This means that it is not giving you x unique arrays for the bucket, but 8 arrays that all reference the same array in memory. That is why when you then add elements to your buckets, it actually is adding to every array in that bucket (since it all points to the same array). So long story short, just copy this guys code, it works lol. Rant aside, thanks for the video!

So helpful!! Can't wait to see the next video

That's really a good solution and I liked your explanation

I liked the walkthrough! What is the big O for this?

Understood the solution properly, thanks!