Accept the parameters and calculate the Compound Interest & print it on STDOUT (Use Math class methods)

Hello sir can this course is complete dsa using java and can it actually help me to master in dsa

Hands down, the best explanation!

You deserve a lot sir❤❤❤

​@itsdineshvaryani thanks for explaining. I am not seeing the xls file in description/comments section. Kindly share it again

plz also grind some CP problems btw ur explanation is very good thanku

Day 1

Thank you

Hi, thanks for the helpful video. There's just a small error at 8:43. When head is null, you are returning the new node directly without assigning it to the head. To solve it: if(head == null) { head = newNode; return head; }

First find the product of all elements and second just devide the product by the index value and store the res in new result array 👍

teach more about CP

Why am I not able to print Arrays with simply using Sysout? Why do I have to use Arrays.toString0 method to print the arrays? I am using Zulu 17.

thank you very much ❤

Great explanation in such a detailed manner. Thanks Sir for all your efforts.

I always implemented LinkedLists after watching your tutorials <3 , and yesterday I just found out about import java.util.LinkedList; ;/ RIP ... still so usefull to know how to implement them yourself!

List<Integer > oddNumberList = Arrays.stream(arr) .boxed() . filter (n-> n%2!=0) .toList(); Time and space complexity is O(n)

what if I solve this problem with this method int[] myArray ={645,567,56,345,234,4567,67,3254} ; int[] resultArray=new int[myArray.length]; for(int i=0; i < myArray.length; i++){ resultArray[(myArray.length-1)-i]= myArray[i]; }

Thank you sir

Thank you

Thank you

Sir eska notes nahi milega

Thank you

Thank you

Thank You

This is linear search or binary?

the best!!!!!!!!!!!!!!!!! the best !!!!!!!!!! !!!!!!!!!!!!! in the entire youtube for dsa.

Thanks for such a great tutorial on DSA with detailed explanation.

Can we buy an offline copy for this book?

Excellent explantion in a short vedeo.Thanks for apploading.

Excellent explanation bro❤

why are you using this

I hope you make a video about skip list

sir i have question regarding vedio cant we use for each loop to print element of array please reply

bro confusing! plz make easy video! another video of post order is for members only

I easily understand sir 😊

thanks for woderful course Dinesh , could you please add advanced Algorithm to the playlist like:Dijkstra, Bellman ford, Floyd Warshall, Kruskal and Prim ,Greedy and Divde and Conquer Algorithms

You have risen through steps.

Will you also talk about hash tables and hash sets in this course?

Sir why are you not use tail , and why you use head node only

You tried your best to explain, thank you

Couple of ways to implement this, I prefer this approach rather than tracking pointers: char[] chars = word.toCharArray(); StringBuilder sb = new StringBuilder(); for( i = chars.length-1; i>=0 ; i --){ sb.append(chars[i]); } return word.equals(sb.toString()); ofc can convert the string input to lowercase or something to cover capital letters. e.g: "Hannah"

Done: 30-09-2024

Hello but starting u told sum> target and decreasing right did anyone observed

Your channel is best.. with quality content ❤❤❤❤❤❤

Nice explanation 😊

I appreciate going through each step, it is a good way to really cement the concepts.

Muito bom. Parabéns.

Watching in 2024, Thank you for making this series!

Hello Sir where I can find the slides of mockito and junit ? Thanks in advance