Would anyone here find it useful if I offered to teach algorithms and data structures, specifically catered towards leetcode kind of problems.
The approach would be (writing it from memory, will revise it if there is any feedback):
First master the basic data structures and be able to manipulate them rather quickly. We will write many small programs to ensure that a one can perform most of the common operations on a given data structure straight from memory.
Then we will write transformations, i.e. being able to convert one data structure into another.
Next up with be problems that requires a combination of data structures.
We will spend a good about of time in graph problems, the usual data structures used to store / manipulate them and understand some of the basic graph algorithms ( MST, Traversal, Shortest Path, etc.)
We will briefly spend some time on sliding window problems.
Dynamic programming, Greedy and divide and conquer techniques are rather simple, but we need to distill it down to a science so that we can code them eyes closed :-)
Order complexity, how to think about it by looking at an intermediate step and calculating how many operations are needed to get to next step. We will dig a little into the mathematical aspect of it.
I've got a couple hundred LC's under my belt but I would still definitely appreciate something like this. Do you have a discord in mind or something else?
Currently gainfully employed still, not sure if being laid off is a requirement but I'd like to keep my skills sharp just in case.
Discord would be great.
The parent comment was -1'ed perhaps because it came across as selling.
Was trying to help folks here as I have recently gone through the ordeal of getting into a FAANG company.
The approach would be (writing it from memory, will revise it if there is any feedback):
First master the basic data structures and be able to manipulate them rather quickly. We will write many small programs to ensure that a one can perform most of the common operations on a given data structure straight from memory.
Then we will write transformations, i.e. being able to convert one data structure into another.
Next up with be problems that requires a combination of data structures.
We will spend a good about of time in graph problems, the usual data structures used to store / manipulate them and understand some of the basic graph algorithms ( MST, Traversal, Shortest Path, etc.)
We will briefly spend some time on sliding window problems.
Dynamic programming, Greedy and divide and conquer techniques are rather simple, but we need to distill it down to a science so that we can code them eyes closed :-)
Order complexity, how to think about it by looking at an intermediate step and calculating how many operations are needed to get to next step. We will dig a little into the mathematical aspect of it.