2872. Maximum Number of K-Divisible Components | leetcode daily challenge | shashcode30

[@shashwat_tiwari_st]

like target is 150. Please do like and comment, if you have understood the explanation as well as code😄

[@harshthakre1700]

sir when will you start dp series

[@nihalsingh6233]

Sir, you haven't uploaded todays leetcode daily challenge !!!!

[@bhushanambhore8378]

where are you? why not uploading POTD leetcode?

[@Ajay-cv1zs]

One Thing that can be done to handle large sum is to return sum%k (only the remainder).

[@Official_Saint]

amazing explanations.

[@mr.nishantawasthi4402]

Sir Dp kb se start kar rahe hai aap?

[@bhushanambhore8378]

I dont get the point of why there is need of comopnentCount to be an array of length 1 instead of simply being an integer?

[@shashwat_tiwari_st]

@@bhushanambhore8378 java is pass by value, kuch be change kra toh update ni hoga. Cpp me chal jaega woh pass by reference hota h

[@bhushanambhore8378]

@shashwat_tiwari_st ohh thanks, it's new for me. I haven't came across such problem where we do this.

[@nishantrathore5031]

sir can we use disjoint set in this question to group all those components whose sum is divisible by k ?

[@karmaff6516]

Hello Sir, might be a silly question or maybe i didn't understand the problem but , is it possible that in the second example values[0] isn't divisible by given k=3 even after getting 0s from all subtrees. if yes, how is this approach handling that case.

[@B-Billy]

In Question it's mentioned that sum of all node will be divisible by K. So if left and rigth are divisible by K, left will make a component and right will ake a component. So parent will always be divisible by K. Eg. If total sum of array is 9. Left is 3, right is 3. So the root value will be 9-3-3 = 3 , 3 is divisible by K. Watch at 1:42

[@karmaff6516]

got it thanks !! ​@@B-Billy