I wonder why your videos are not getting good views. Your way of explanation is awesome. Keep uploading more videos.
@nikoo28
6 ай бұрын
I will try my best
@democreation3594
Ай бұрын
Your way of explaining and presentation is great bro. you deserve more views but small suggestion after you explain the code if you code along in leetcode it will be more easier for us to understand rather than seeing the final code so it might increase the views.
@nikoo28
Ай бұрын
i do not plan on coding along in leetcode, there are a lot of youtubers who do the exact same thing. languages keep changing with time, so I would focus primarily on problem solving. You have so many chat GPTs available too which can write the code for you.
@jenniferfan8155
5 ай бұрын
Very detailed explanation. Thank you
@jagdishkhetre4515
Ай бұрын
Excellent explanation ... Thank you so much
@sahelisohanitwins7492
5 ай бұрын
Nice explanation sir ❤
@PiyushYadav-pl9jm
2 ай бұрын
Best explanation ever!
@limitless6189
4 ай бұрын
great explaination
@anveri867
21 күн бұрын
When using a single queue we can make either push or pop efficient it doesn't have to be push only , so isn't it better we use a single queue or over 2 queues ?
@sahilbait2981
Ай бұрын
Best !!!
@akashbestcode
3 ай бұрын
amazing dude, I'm gonna subscribe you
@prakhargarg4166
6 ай бұрын
Best video
@rudreshcm4172
6 ай бұрын
Hey nickil which software tool you use for visualizations and any drawing pad?
@nikoo28
5 ай бұрын
That is GoodNotes 6
@karthik-varma-1579
6 ай бұрын
Sir Please Organise the playlist or videos with video no sir if I want to learn arrays in Java then I could find the video of main understand sir
@nikoo28
5 ай бұрын
have you checked the playlists on my channel?
@akhil7618
4 ай бұрын
Sir, I wanted to see the code for stack using 2 queues😢
@nikoo28
4 ай бұрын
Did you check the code provided in the video description?
@akhileshnandanwar7443
4 ай бұрын
sir there is no code of stack using 2 queues
@nikoo28
Ай бұрын
class StackImplUsingQueues { Queue q1 = new LinkedList(); Queue q2 = new LinkedList(); public int pop() { if (q1.peek() == null) { System.out.println("The stack is empty, nothing to return"); int i = 0; return i; } else { int pop = q1.remove(); return pop; } } public void push(int data) { if (q1.peek() == null) { q1.add(data); } else { for (int i = q1.size(); i > 0; i--) { q2.add(q1.remove()); } q1.add(data); for (int j = q2.size(); j > 0; j--) { q1.add(q2.remove()); } } }
@engineermind1651
Ай бұрын
your way to explain theoritical is good but explain the code you more improve please.
Пікірлер: 22