Видео

Please make more videos like that in Java

Great job sir...from acciojob 😅

I need to visible z index where it is can you help me

you dont't need to create TreeNode again you can sum root1 val and root2 val and update that sum in root1

Bhai Thoda Dhan se

is line 4 a new expression?

thank you for clarity

What is the time complexity of soln

Now he is in accio job

2hy we dont initialise count =0; globally?

I was searching for a way but lintcode requires phone number and all, then instead of putting lintcode I put codingninjas and got the link for the problem, people can also try other platform in the search query

cannot signup lintcode, didnt receive otp?

You explained awesome 👍

Sir prepaid course ka kiya plan hy..

Her voice is so soothing

Don't know indian but understood, tnks

Don't know indian but understood, tnks

If you are not posting your next video , why do you commit in the current video ?

thans bro

can we go with two pointer approach?

thanks man!!

Thanx brother great approach

Video starts at 3:30

Good method.

Things i dont like: Notification sound coming from background > made me check my devices Colorful Pen usage + bad hand writting > hard to follow (if the color scheme was consistent atleast for a word would be nice but this just feels like kindergarten) By the way thanks for the video.

but unable to sign up lintcode

cheers! Thank you!

Dhynawad bhaiya

Bhai kya tum Aligarh se ho

thx

where is next video of hash map

Thanks :)

is he burping during this?.........

nice explained but sir where where is problems in hashmap plz let me know i want to learn more abt it

sir , you think you working on JAVA 🤣🤣

Thank you very much, did not know JS had this feature being using objects for hashmaps and its hell

Shaat samjha meko

They are calling , I am not picking up 😁

??????? ?

🤗😊

CPP Solutions is class Solution { public: int maximumProduct(vector<int>& nums) { int max1 = INT_MIN, max2 = INT_MIN, max3 = INT_MIN; int min1 = INT_MAX, min2 = INT_MAX, min3 = INT_MAX; for(int i = 0; i < nums.size(); i++){ if(nums[i] <= min1){ min2 = min1; min1 = nums[i]; } else if(nums[i] <= min2){ min2 = nums[i]; } if(nums[i] >= max1){ max3 = max2; max2 = max1; max1 = nums[i]; } else if(nums[i] >= max2){ max3 = max2; max2 = nums[i]; } else if(nums[i] >= max3){ max3 = nums[i]; } } return max(min1 * min2 * max1, max1 * max2 * max3); } };

Awesome bro

Thanks Bhai😇

simple and easy solution. thanks a lot

Thank you for having me😀

Awesome Finally ❤️❤️

🤗😇

Sir please make a video on javascript

hi janvi sorry to ask you here but your Instagram id is disabled i guess....i am unable to find u there.