I feel game theory should also be a part of the collection
Hi admin,
Appreciate the effort you have made. Whole bunch of programs all at one place. This is awesome!!!
Binary program, its explanation and examples are good.
I found this link https://www.flowerbrackets.com/binary-search-java/ short, crisp and perfect explanation.
Just a suggestion!!
Thanks for the comprehensive list. You can find some more supplemental Data Structure Interview Preparation material here.
For Euler path and circuits, I think this presentation is very ‘meaty’, explained in lucid and short manner without extra loads of history of 7 bridges and how euler solved it!
https://www.math.ku.edu/~jmartin/courses/math105-F11/Lectures/chapter5-part2.pdf
Here’s the quicksort algorithm and merge sort algorithm along with explanation, implementation and example. Hope it helps everyone.
Here’s the most practical segment tree explanation and implementation I’ve ever read:
Efficient and easy segment trees
Here is one more resource which I think you should add to your list - https://www.interviewbit.com/courses/programming/topics/dynamic-programming/
i just need some upvote to upvote this post
thankyou so much guys for such help;it is really helpful for me as now i have a concise collection for what should i look upon.
keep up the good work community
please make github repo for this…
Check out the best DSA tutorials. Here you will find the best dsa tutorials recommended by programming community.