Divide Array Into Arrays With Max Difference - Leetcode 2966

Divide Array Into Arrays With Max Difference - Leetcode 2966 - Python

Рет қаралды 11,304

Күн бұрын

🚀 neetcode.io/ - A better way to prepare for Coding Interviews
🧑‍💼 LinkedIn: / navdeep-singh-3aaa14161
🐦 Twitter: / neetcode1
⭐ BLIND-75 PLAYLIST: • Two Sum - Leetcode 1 -...
Problem Link: leetcode.com/problems/divide-...
0:00 - Read the problem
0:10 - Drawing Explanation
4:38 - Coding Explanation
leetcode 2966
#neetcode #leetcode #python

Пікірлер: 26

@julianelmasry9556 5 ай бұрын

NO WAY. HELLA EFFICIENT EASTER EGG ACTUALLY GOT DROPPED

@shreehari2589 5 ай бұрын

What Easter egg are you talking about?

@dong-hanguyen8266 5 ай бұрын

class Solution: def divideArray(self, nums: List[int], k: int) -> List[List[int]]: # Sort the nums nums.sort() # O(nlogn) ans = [] low = float('-inf') split = [] # Runs through O(n) for each index in nums for i in range(len(nums)): # Sets the low if low == float('-inf'): low = nums[i] # Checks difference if abs(low - nums[i]) > k: return [] else: split.append(nums[i]) # Adds to ans array if len(split) == 3: ans.append(split) split = [] low = float('-inf') # Checks lens if len(split) == 0: return ans His solution was so simple 😢This is why I failed my FAANG interviews...

@mnaresh3382 5 ай бұрын

Finally something that I could solve myself efficiently, definitely seeing some improvement, thanks neetcode

@AMakYu 5 ай бұрын

Hella efficient 👌

@ooouuuccchhh 5 ай бұрын

Me waking up at 7:30 in this winter morning to find the first video as neetcode video

@CrabGuyy 5 ай бұрын

you and me both, brother

@Onyaga 5 ай бұрын

This solution is quite trivial i thought it was an easy problem and was racking my head trying to think of a better, O(n) soln. The example literally gives a big hint that the answer will be an arrangement of sorted elements

@a_maxed_out_handle_of_30_chars 5 ай бұрын

thanks, i knew it had something to do with sorting but couldn't solve further

@feazysil2707 5 ай бұрын

next time you got this!

@Aliennnaa 5 ай бұрын

yeah i solved after struggling for one hour or so and checked comments on leetcode and got discouraged T_T .

@nameless2850 5 ай бұрын

I didn't the constraint of size 3 and was over complicating by sorting + dp

@sprajosh 5 ай бұрын

I thought you've already made a video on this question

@hemanth.alluri 5 ай бұрын

Honest question: how is this a medium?

@TrickyCat 5 ай бұрын

@NeetCodeIO I wonder since when Python does deep copy in this case: kzbin.info/www/bejne/jp3IgJylZtR9m9E That's a shallow copy, dude: ```python a = [1] l1 = [a] l2 = l1[0:] l2[0].append(42) print(a) print(l1) print(l2) ``` If the copy was "deep" it would create the separate subcollections (sublists in the case above), but as the example shows, the list (which `a` points to) is being reused

@SanketBhat7 5 ай бұрын

But for me this was the initial approach. But I kept thinking there must be some O(n) solution, but there isn't!!!

@garsidrag 5 ай бұрын

hell satisfying outro !

@kunwarankush6030 5 ай бұрын

From the question description, there are 2 condiditions that every array must satisfy. Majority of the solutions cater to the condition of difference of two elements in an array to be

@GarethNgFilms 5 ай бұрын

The wording is a bit confusing, but what they mean is that each instance of a number has to be in one of the subarrays. It's ok if the value appears in multiple