Subarray Product Less Than K - Leetcode 713 - Python

🚀 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/subarra...
0:00 - Read the problem
0:30 - Drawing Explanation
8:00 - Coding Explanation
leetcode 713
#neetcode #leetcode #python

[@NeetCodeIO]

Yes I use a mouse to draw, in case you still don't believe me. Why? Because with a mouse you can artificially lower the DPI, such that I have to move my hand a few inches to move the mouse cursor by a single inch. This means I can be more precise than if i were using a pen.

[@spsc07]

is your mouse acceleration on?

[@NeetCodeIO]

I dont think so edit: actually yes it is

[@blakewen4265]

what software do you use to draw?

[@varunpenumudi]

What software do you use for drawing?

[@spsc07]

i guess Windows Whiteboard or something like that@@varunpenumudi

[@joelmendez9616]

I’d prefer no cam, just to be able to focus better, especially since there is a disparity in light

[@ragilr1]

Big fan of your work. Would like the earlier format without face. A lot of attention goes to your handsome face than looking at the explanation drawings

[@kebab4640]

Woah, I said the same thing.

[@huyennguyenmaingoc468]

Yes I felt the same thing. Glad you shouted this out XD

[@user-j5ja95]

Hey Neetcode I love your channel and love you and you're super handsome but personally I find having camera on leetcode video to be a bit distracting so I prefer no camera. Nothing personal, I can just focus on content better without camera ❤

[@dingus2332]

Yeah , agree to that

[@ashersamuel958]

Same here too. Love your content ❤

[@chien-yuyeh9386]

Really happy to see you here again!🎉

[@krishnavamsi9326]

I prefer videos with face. It's good seeing you explaining . Big fan, been following you since 1 and a half years.

[@walkastray007]

Hey I really appreciate your consistency on posting videos. Also I like the webcam, now we can see your reaction to the problems as you are explaining them to us. Makes it feel like you're human after all..

[@SC2Edu]

Great as usual. I approached it correctly with a sliding window method, but I used slices and I was not using the difference between indices. Great intuition, thanks.

[@gauravsharma-lu4if]

i have been watching your channel for a while now, you are helped me a lot with learning dsa . keep the camera on . i like it this way

[@MP-ny3ep]

Great explanation as always. Thank you

[@CS_n00b]

Here is a better way to understand why getting all subsequences is O(n^2): First element needs n operations to get all n subarrays, n-1 for second etc... We are summing over numbers from n to 1 This can be thought of as a discretization of the integral of x from 0 to n this is 0.5*n^2 ~ O(n^2)

[@chisomedoka401]

Bro, your consistency level is off the roof. I’m literally finding it hard to understand why you still leetcoding you already got it all

[@KunalSharma-tf3kk]

very helpful your videos are...

[@massimomonticelli6010]

Hey NeetCode, I like the camera view!

[@viizualares6890]

W NeetCode as always. I don't think you have ever missed once.

[@sri_harsha_dv]

I tried to do it with queue instead of sliding window. Despite being O(n) memory solution, the submission passed pretty efficiently. Thanks for O(1) solution. I personally like video with cam included.

[@user-rv1bx8hx4v]

Thank you!

[@adnanmurtaza6914]

The facecam makes the video feel more personable. I can see how it can be distracting, but I think it brings in more value than it takes away.

[@prashanthkumar0]

Today's daily problem question , i was searching this with every possible filter to get a solution video from neetcode 😂 Finally its here... I didn't get (r-l+1) logic in other's code ... now its clear why Thank you

[@hristianiliev7979]

I almost had the solution for this problem and I identified the part where we are missing to count the array [5], but I did not know how to prove how many new subarrays that satisfy the condition we are adding on every correct step. I even went looking for variant formula and combinatorics. Who knew that such a simple observation with the equation is the answer.

[@rvishwakarma94]

I believe the total number of contiguous subarray is not just n^2. It is n + (n-1)+ (n-2) .....+1 = [n*(n+1)]/2 . So for array of size 4 the total number of contiguous subarrays will be 4+3+2+1 = 10 and not n^2 = 16

[@azharuddinkhan1865]

Facecam is great addition. It provides classroom feeling and easy to understand with facial gesture

[@romannikiforov5122]

I was struggling with this problem couple of weeks ago and was upset to know that you didn't have video on it.

[@yang5843]

Interested in seeing how the feedback for cam-on videos will be!

[@spsc07]

W man, W Webcam I would love to see this I was just doing this question !!

[@satyamjha68]

Solved it!!

[@AdityaBhongade]

Hey NeetCode, your content is great. It would be better if you increase the audio.

[@sidhartheleswarapu]

Why l

[@ahmedhamed1154]

Another solution We can desfine int nxt[N] such that nxt[i] is the next element to the right not equal to 1 and for each pos i, we can show that the maximum number of jumps is log2(k) which is about 20 jumps int mult=1; int j=i; while(j is not out of the range && mult*a[j]

[@arunmurugan7093]

I was gonna do the daily today and just saw your upload. I guess ill be back here in 1 hour. 😅

[@art4eigen93]

will this work for negative values too?

[@akshaychavan5511]

NEETly explained! Thank you so much :D def numSubarrayProductLessThanK(self, nums: List[int], k: int) -> int: res = 0 p1, p2 = 0, 0 currentProd = 1 while p2

[@Akhillbj]

For loop is better, sometimes you still forget to increment p2 , most might not , just in case! You never know

[@akshaychavan5511]

@@Akhillbj I agree. Will keep this in mind.

[@inderlalchandani]

Nice

[@JSH1994]

cam or no cam it doesn't bother me :) thank you for your work

[@ankandebnath1056]

bro keep doing the daily challenges

[@tokkiM3]

I like the face cam, keep up the good work.

[@isseihyodou7111]

Hey, Neet love your videos man, would love to see the video more focused on the solution, a lot of attention goes on to your handsome face :D

[@dingus2332]

I understand the solution , but want to know , why we could not use DP here ? , also like Subarray Sum Equals K , why we were not able to use prefixSumDiff to count map ??

[@tommyshelby6277]

with face cam op!

[@ZeckTTV]

I like having the camera on, I feel like you do a better job explaining your throught process with it on.

[@juuzousuzuya69]

there is no way I would think this solution in 1 go, I might know it will be a sliding window problem but the logic behind right - left + 1 would result to counting the subarray? I wont be able to guess or think of it lol.

[@user-ty7og3rd4z]

I definetly like the videos with face cam!

[@chien-yuyeh9386]

🎉🎉🎉🎉🎉

[@ronbuchanan5432]

It's good to see you, don't get me wrong but it also has got me distracted because I want to focus on what you're doing but at the same time you kinda want to glance to the face that talks

[@ShashiKanthvarma-lb6xb]

Binary search is very hard to think about

[@pepe-pj9wr]

WE LOVE THE CAM ON!

[@m.kamalali]

Hhh , i did the exact same code only difference i used p instead of product

[@slambam4592]

Without facecam. Feel it can be too distracting

[@alicenNorwood]

I prefer with cam

[@ttowe]

better with camera

[@kz_cbble9670]

No camera preffered! Keep camera on in story or other videos

[@yang5843]

Java Solution class Solution { public int numSubarrayProductLessThanK(int[] nums, int k) { int prev = 1; int rc = 0, i = 0; for (int j=0;j

[@expeditiontoabyss3597]

i was shocked that I couldn't find a solution this morning in your channel. But now its here, probably some race condition.

[@ignsock2915]

i love you

[@edmonddantes587]

god damnit I was a gnat's c*nt hair away from a working solution. Thanks for the vid, bro

[@kahafb]

Like the facecam

[@nirmalgurjar8181]

I cant see your bag on the floor, so no point in keeping camera :P

[@krateskim4169]

Face cam is good

[@pastori2672]

you look so cute bro 🥰

[@MikeTypes]

It’s better to have your face on

[@dipakrajbhar2723]

Are you Indian

[@kebab4640]

I like it but your jawline makes you look so handsome that you distract me 😍

[@zweitekonto9654]

Definitely dont like the face cam. Just because it takes up screen space and serves absolutely no purpose.

[@shakibrahman]

sorry you're too handsome it's distracting me

[@tanishqbhatt9619]

No offense to you, but I'd prefer videos without a face cam

[@PickNick50]

Please no face cam bro, I come here to study and seeing anyone's face is not gonna help me to learn more. And I low key respect those who maintains anonymity.

[@tanish5662]

no face please