Data Structures and Algorithms



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!


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


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


Check out the best DSA tutorials. Here you will find the best dsa tutorials recommended by programming community.


Just a suggestion. Sort this list according to their usage. Like, the algorithms which are most used would be ranked first, then the rarely used problems.


I do add the ones that I find are good.


Added. Thanks :slight_smile:


Thanks a lot :slight_smile:


Thanks a lot :slight_smile:


I hope so too :slight_smile:


will add :slight_smile:


More concise collection of STL…


Thanks! :slight_smile:


Thanks! :slight_smile:


For BIT use this tutorial: - way better than all other resources.
And thanks for the resource.


Thanks friends .These links are really useful for newbies like us. May Allah(swt) bless and guide all those who contributed in collecting these links.


already added :slight_smile:


Thanks added :slight_smile: