Thanks to someone pained, it's not a bad idea to have a section where anyone can discuss Algo and DSA

1. There should be no egos here TastyFriedPussy aka sqlPain
2. Recommendation of Algo book
3. Encourage Study groups among people
4. Encourage implementation of Algo in a different language or performance tricks

I think the best approach is DSA first then Algo, but I will share some resources, I think have discussion is important too

A suggestion, would be nice to have some dsa problems once in a while to solve, it should keep the thread busy if the problems are interesting enough.

namikaze:
A suggestion, would be nice to have some dsa problems once in a while to solve, it should keep the thread busy if the problems are interesting enough.

You're right I'll post a question pertaining to a DS, I'll prob pick from Hackerrank and Codeforce, but something beginner from Array to Graphs. It will engage us

Great suggestion. Thumbs up! I'll say some dsa or Algo to solve once in a while. Then, we dissect the 'solution' (knowing fully well there's no absolute solution in programming)
If qtguru won't mind, let's kick start with quicksort
Given an list array
larray = [97, 502, 200, 100, 101, 211, 107, 102]
Create a Python quicksort function. Ensure your code include meaningful comments.
Start: 23 Dec 08:15 NGN | End: midnight 28 Dec 2022

qtguru:
You're right I'll post a question pertaining to a DS, I'll prob pick from Hackerrank and Codeforce, but something beginner from Array to Graphs. It will engage us

namikaze:
A suggestion, would be nice to have some dsa problems once in a while to solve, it should keep the thread busy if the problems are interesting enough.

So let me get something right, a lot of you guys throw around acronyms that now seen confusing to me. My understanding is that

DSA stands for Data Structures and Algorithms
Algo stands for Algorithms

so when DSA and Algo are thrown together, I get a little confused because AFAIK the "A" in DSA is the same as Algo. Any more active devs wanna clarify?

Also before diving in to sharing problems (someone has already "gotten" to quicksort now now lol), I think it would be nice to give a background on the various data structures as well as the algorithms. It's been a few years I've been down the DSA route but if memory serves me right the DS were
Queues
Stack
Trees
(I don't recall learning Hash)
which were implemented with pointers and arrays.

The Algorithms if I remember correctly were split broadly into Search Algorithms and Sorting algorithms. Would be nice for someone to then list out the various search and sorting algorithms. I remember Bubble Sort and Insertion sort as well as Quick Sort. I'm literally pulling these stuff from my 2003 self. So over to the devs more in touch with all of the state of art info about DSA and put some clarity for folks reading

airsaylongcome:
So let me get something right, a lot of you guys throw around acronyms that now seen confusing to me. My understanding is that

DSA stands for Data Structures and Algorithms
Algo stands for Algorithms

so when DSA and Algo are thrown together, I get a little confused because AFAIK the "A" in DSA is the same as Algo. Any more active devs wanna clarify?

yes your understanding is alright, though technically the DS and A/Algo are different, they're are usually used exchangeably because they coexist.

namikaze:

yes your understanding is alright, though technically the DS and A/Algo are different, they're are usually used exchangeably because they coexist.

Yes I fully understand that the Data Structures are completely different from the Algorithms. I was just a bit confused with qt's post that mentioned dealing with DSA first then Algo later

airsaylongcome:
Also before diving in to sharing problems (someone has already "gotten" to quicksort now now lol), I think it would be nice to give a background on the various data structures as well as the algorithms. It's been a few years I've been down the DSA route but if memory serves me right the DS were
Queues
Stack
Trees
(I don't recall learning Hash)
which were implemented with pointers and arrays.

The Algorithms if I remember correctly were split broadly into Search Algorithms and Sorting algorithms. Would be nice for someone to then list out the various search and sorting algorithms. I remember Bubble Sort and Insertion sort as well as Quick Sort. I'm literally pulling these stuff from my 2003 self. So over to the devs more in touch with all of the state of art info about DSA and put some clarity for folks reading

The data structures usually fall under arrays, linked lists, stacks, queues, maps and graphs, tree's are graphs, binary trees, binary search trees, self-balancing trees, heaps and tries are under tries. there's a special case of priority queues too.
The more complex data structures (minimum spanning trees, red black tree, quad tree) are almost always unordered are generally under trees and graphs.
There are many sorting algorithms, most common include selection, insertion, bubble, heap, merge and quick sorts. searching algorithms are usually just binary and linear, which work only for select data structures like arrays, linked lists and binary search trees.
There are more to algorithms than to searching and sorting, there are also algorithms for traversing trees/graphs, adding/deleting a node to trees e.t.c An algorithm is basically a step by step sequence of finite instructions that does a specific task, with this definition, a simple print statement is still an algorithm.
I agree, a sort of simple background on the most important data structures and algorithms would be good.

airsaylongcome:


Yes I fully understand that the Data Structures are completely different from the Algorithms. I was just a bit confused with qt's post that mentioned dealing with DSA first then Algo later

I sse, both terms are usually used exchangeably yes

namikaze:

The data structures usually fall under arrays, linked lists, stacks, queues, maps and graphs, tree's are graphs, binary trees, binary search trees, self-balancing trees, heaps and tries are under tries. there's a special case of priority queues too.
The more complex data structures (minimum spanning trees, red black tree, quad tree) are almost always unordered are generally under trees and graphs.
There are many sorting algorithms, most common include selection, insertion, bubble, heap, merge and quick sorts. searching algorithms are usually just binary and linear, which work only for select data structures like arrays, linked lists and binary search trees.
There are more to algorithms than to searching and sorting, there are also algorithms for traversing trees/graphs, adding/deleting a node to trees e.t.c An algorithm is basically a step by step sequence of finite instructions that does a specific task, with this definition, a simple print statement is still an algorithm.
I agree, a sort of simple background on the most important data structures and algorithms would be good.

Lol! Now that that you mentioned trees, I remember learning about Binary Search Trees. And some tree algorithms about depth-first or breadth-first....it's been years man!

@qtguru
another suggestion
solutions to problems should not be posted here but on some kind of shareable online interpreter/compiler, so it's easier to test and also to tidy the thread, c++ is notorious for dirtying threads

airsaylongcome:


Lol! Now that that you mentioned trees, I remember learning about Binary Search Trees. And some tree algorithms about depth-first or breadth-first....it's been years man!

you actually did pretty good to even recall them back from 2003, I left my dsa course and daily practice for the hng internship and in just two months I've lost some of my edge.

namikaze:
@qtguru
another suggestion
solutions to problems should not be posted here but on some kind of shareable online interpreter/compiler, so it's easier to test and also to tidy the thread, c++ is notorious for dirtying threads

Makes sense,

How about we say we start by January first and we make sure we've solved all the problems on
Leetcode before 2023 ends.


Like, 1-3 problems from leetcode everyday until the end of 2023


If we eventually solve all the problems before the end of 2023 we'll all be proud we collectively solved all of leetcode's problem.


If it involves getting the premium account.

I'm ready for group contributions.

How do you guys understand this DSA to the extent of solving all leetcode questions of a thing?? That DSA is the most difficult thing for me to understand so i give up on it.

qtguru:
Resource for the Day: Analysis of Algorithm
https://cs.lmu.edu/~ray/notes/alganalysis/

I strongly believe dropping questions will be far better than dropping resources.


Dropping just resources will see this thread lost in oblivion before New year just like your other threads.

No offense!

Sheriman:
How do you guys understand this DSA to the extent of solving all leetcode questions of a thing?? That DSA is the most difficult thing for me to understand so i give up on it.

You don't just suddenly understand everything to the point of solving all the problems.


If you start solving from the very basics, you'd see yourself solving medium difficult questions in few months time

Sleekcode:


I strongly believe dropping questions will be far better than dropping resources.


Dropping just resources will see this thread lost in oblivion before New year just like your other threads.

No offense!

I strongly disagree but you are free to post your question, classification of alogrithm is important. Anyone that wants to read should read

semmyk:
Great suggestion. Thumbs up! I'll say some dsa or Algo to solve once in a while. Then, we dissect the 'solution' (knowing fully well there's no absolute solution in programming)
If qtguru won't mind, let's kick start with quicksort
Given an list array
larray = [97, 502, 200, 100, 101, 211, 107, 102]
Create a Python quicksort function. Ensure your code include meaningful comments.
Start: 23 Dec 08:15 NGN | End: midnight 28 Dec 2022

Must this be in python?

qtguru:


I strongly disagree but you are free to post your question, classification of alogrithm is important. Anyone that wants to read should read

You can disagree all you want.

But I'm not wrong.

Sleekcode:


You can disagree all you want.

But I'm not wrong.

It's a free group, whatever you feel makes sense to post is up to you and anyone, it's joint effort, so you can post questions, and code challenges.

qtguru:


It's a free group, whatever you feel makes sense to post is up to you and anyone, it's joint effort, so you can post questions, and code challenges.

Wow, thank u

This not my group, I just created it, I'm just posting what makes sense to me, you can post what makes sense to you, and discussions. Just no insults and making people look silly because they don't solve as quick as you do.

I can tell there's going to be an ego issue here which is why I say no insults, if you know it compared to the average coder, explain no need to ridicule anyone.

Thanks all

Also I strongly advise a github repo for it, you can always come back to read it.

Sleekcode:



Must this be in python?

no any language should do, just share a link to any online code editor so it's testable.

qtguru:
Resource for the Day: Analysis of Algorithm
https://cs.lmu.edu/~ray/notes/alganalysis/

nice resource, should be a good refresher on analysis, thanks.

Sleekcode:


I strongly believe dropping questions will be far better than dropping resources.


Dropping just resources will see this thread lost in oblivion before New year just like your other threads.

No offense!

True the problems are what's gonna drive the thread, but resources shouldn't hurt, especially good reads like the one he posted.

namikaze:

nice resource, should be a good refresher on analysis, thanks.

I agree, this allowed me to always know how to understand how slow my algo could be

I recommend it

Warming up ��‍�

Nice endeavor guys!