Analysis of Algorithms
Stacks and Queues
Balanced Search Trees
Geometric Applications of BSTs
Symbol Table Applications
Minimum Spanning Trees
Maximum Flow and Minimum Cut
Part 2 as part 1 has 5 programming assignments and about 30 interview preparation coding exercises. Link to course (https://gb.coursera.org/learn/algorithms-part2)
I plan to do part 2 anyway, but I prefer to do that after getting a job as a SE because it takes long to complete diligently.
I guess that if I am good at algorithms may be enough to get a job as a Java Engineer because some recruiter told me that if I had passed the algorithm test they would have given me the job and they provide the rest of the training I need, that is why I am studding Algorithms.
yeah so there’s probably conflicting opinions about this online but I will tell you that in the part 2 outline you showed there are some very important concepts.
However I am unsure how much these concepts play into getting a job as a java dev. Maybe a little bit or maybe not much.
I think your plan to come back to this 2nd course later is probably good. Especially as you are eager to ‘test the waters’ and see how things go in a job search. Worst case you get an interviewer who asks something that you don’t know and you can then take some time to catch up at that point (or best case, no one asks anything that relates to that and you learn it on your own time later)