Відео

I've been following you for a while now sir, your teaching method has given me a solid understanding of the java programming language, thank you so much, but I also have one suggestion if you can make a video on how to create an interactive GUI using javaFX

3,1 fail ho rha h isse

omg great man

Such a amazing explanation

Code

u look Anirudh Ravichander(Famous Tamil Music director) ;)

Please answer for 9

Bro does the job perfectly!

sir the time complexity for this cannn also be minimize to o(1) or o(4) by this if(num==1)return false; if(num==2||num==3||num==5)return true; if(num%2==0||num%3==0||num%5==0)return false; return true; }

It is giving 404 error

i dont know some miracle happend i understood this problem very easily

Wow what an explanation

Nice 👍👍👍👍 thanks 👍👍👍👍

❤❤❤❤❤❤

Best Explanation sir...

Best way to teach pass by value and pass by reference. Thanks!

Thanku ku

Wow the explanation 👌

Thank u sir 🎉❤❤❤❤

Sir please upload strings and stack videos

I have a very simple technique to do this first create your window and then make it slide. Window creating is simple just keep on adding the array elements till i = k - 1 and then slide with this logic For ( i to len-1) Wsum += arr[i] If (i > = k-1) Maxsum = max(maxsum,wsum) Wsum= wsum - arr[ n- (k-1)]

best explanation ever

i gurantee nobody on youtube can explain better than him❤

Could not sleep due to sub arrays problem now got it everything❤❤

Hats off you bro 🫶

Gajab magically explained

Is it a binary search?

Sir shall I return h instead of using res?

Best Explanation!!! Thank you so much

Thankyou sir, Your Explanation is too god and kudos for your efforts.

The duplicate elements are continuosly placed one another so only its working but if the duplicate elements are placed randomly means it will not work properly so please checkout this problem and correct code

Are you from kerala?

Superb🎉

Superb sir 🎉 just no words 🎉

Em chepthunavura ayya😢

use i and j instead of nz z it will make complicated to understand

val half=(n+1)/2 val intermediate_height=pow(2,half)+(pow(2,half)-2) val height=if((n+1)%2==0) intermediate_height else intermediate_height+1

This approach is very useful for any programmer out there. With this approach, you can develop logical thinking in programming and can solve problems which you haven't seen before. I took me about a 2 - 3 months to build up logic in programming by this method.

Thank you for this amazing course.

sir , please make video on leetcode questions. The way you explain the solution is awesome.

How to do it using array

brilliant ... from editing to teaching

Amazing explanation 🤟🤟

best video bro

24:09 why we did +1 not understood

Only 934 likes . It deserves more . This channel is gem compared to other UA-cam gurus with 1 year exp,2 year exp in it industry having minimal knowledge

The best explanation on this permutation question u can find on youtube !!!!!!!!!!! thanks for this amazing video.☺

How can you think of it at that level?......Just wonderful sir..... Understood the explanation only in single view.....❤

package com.raji; public class PowerOfN { public static long pow(int x,int y){ if(y == 0) return 1; if (y%2 == 0){ long res1= pow(x,y/2); return res1*res1; } else{ long res1= pow(x,(y-1)/2); return res1*res1*x; } } public static void main(String[] args) { System.out.println(pow(5,9)); } } Can we write like this?