Associate-Graduate:Developer

A foundations course that builds eleven core data structures from the ground up (arrays, matrices, stacks, queues, linked lists, trees and BSTs, hash tables, hash sets, heaps, graphs and tries), then covers sorting, searching, greedy and divide and conquer. Every chapter has practice problems, flashcards and an assessment. It suits students and career switchers whose foundations came from tutorials and who find pattern courses move too fast.

• Job search
• DSA
• CS fundamentals

A browsable practice library of coding problems that can be filtered by pattern, data structure, difficulty and company, so you can drill exactly the weakness you found this week. Patterns include two pointers, sliding window, hash maps, stacks, backtracking and greedy algorithms, with company filters for Google, Meta, Microsoft, Amazon, Oracle and LinkedIn. Free to browse, with an in-browser editor and solutions.

• Job search
• DSA

A practical course on negotiating compensation in tech, from preparing and building a strategy to specific tactics, the full package beyond base salary, handling multiple offers and asking for a raise. It has tailored sections for fresh graduates and experienced engineers. It suits anyone with an offer coming, and anyone who has ever accepted the first number out of discomfort.

• Career
• Job search

Abdul Bari's channel is a classic university-style course on the design and analysis of algorithms, taught on a whiteboard in clear English. It covers complexity, divide and conquer, greedy methods, dynamic programming, backtracking, branch and bound, NP-hard problems and string matching, plus Java programming. It suits computer science students studying algorithms as a subject.

• DSA
• CS fundamentals
• Programming

A sequenced path of six text-based courses for the engineering manager interview loop, combining coding, system design, microservices patterns, people management scenarios and senior leadership questions. It suits engineers moving into management and managers changing companies, who need to prepare for both the technical and the leadership rounds without piecing a plan together themselves.

• Career
• Leadership
• Job search

A free, volunteer-run encyclopedia of algorithms and data structures used in competitive programming, with clear explanations, proofs and C++ implementations for everything from the sieve and binary exponentiation to segment trees, LCA and string algorithms. Started as an English translation of the Russian site e-maxx and has grown well beyond it.

• DSA
• CS fundamentals