Underrated channel😢

quite the crap

Lets say i want to start with the root node, [0, -1, 1, -2, -2, etc.] how can i accomplish that.

Simply Super Sir, A Big Thanks to you:)

Love your content man its so easy to understand now im very thankful❤

This video helps me to understand this topic, Thank you so much.

Thank you so much sir... This is the best playlist for heap sort in the KZbin. Please give you more and more content....

Your voice is soo nice 😊

this code doesnt wor for right view it works for level order

great explanation

Hi All , Started New You tube channel for Playwright Java Videos for www.youtube.com/@QAShastra?sub_confirmation=1

sc=0(height of node) beacause of recursive stack space

plz try to explain in c++ for further POTD's .....

🤛

nice thank you sir

Informative one with very less views and likes.

Something dosent seems correct

Aby hindi m hi samjha le bhai kuch bi bolra hai

All videos are awesome 😎😎😎

Nice explanation👌

So good man

chat gpt copy kada bro

Jookeeper

Thank you very much.....

shit english,

Informational. Keep it up. ❤

tq

do not waste your time by watching this video

Your 2nd condition is not correct. It should be (node1 == null && node2 != null) && (node1 != null && node2 == null). then return false. You also mention it in the video. Maybe it's a typo. Thanks for the explanation by the way.

you are unable to explain.

In order to make your Example work in the Immutable class you should change private final Engine engine to public final Engine engine; Otherwise it will not be accessible in the main class as System.out.println(immutableClass.engine.speed); I wonder how come you are bale to access private object of Engine in the main method using ImmutableClass object.

Again, this accent! Nope!

Thanks...

public class SeperateZeroAndOne { public static void main(String[] args) { int[] nums = {0,1,0,1,0,1}; int left=0,right=nums.length-1; System.out.println("Start it"); while(left<right) { if(nums[left]==1) { while(nums[right]!=0) { right--; } int temp=nums[left]; nums[left]=nums[right]; nums[right]=temp; } left++; right--; } for(int i:nums) { System.out.println(i); } } }

Guruji how are you doing Looking for upcoming OpenAI sessions

May i know how the same can be done with Python, If any is not present or displayed then it should fail it with a message

Beautiful

Very less information provided

Super

very nice explanation

Ye kya hua...humne kahan inset kia last me value....ye to wahi reh gaya...5 number insted.

Didn't though this question can be solved by sorting with some small changes!!

Great video. But does anyone know leetcode link for this problem?

watching it now, and its still very good compare to other tutorials. great work @Coding Simplified.

Bro thanks a lot!

good explanation but can you simulate multiple user scenario using threads?

Tqs ku god

What will be the complexity in average and best case and how?

Nice explanation!! In this design pattern we are creating instance in factory class using if else depending on our requirement but what if class name of bike or car changes ? Then we need to change instance name in factory class. Can we loosely coupled it as well?

Nice Explaination