Software Engineer, Early Career - Immediate Start

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 free newsletter of short, focused posts on system design and problem solving, from the team behind the Grokking courses. Recent posts cover company interview processes (such as OpenAI and Anthropic roles), the most asked mobile system design questions and preparation plans, each linking to a fuller article on the blog. It suits engineers who want a steady, low-effort way to keep system design and interview topics fresh between deeper study sessions.

• System design
• DSA

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

The second volume of Grokking the System Design Interview, aimed at senior and staff (L5/L6) design rounds. It works through harder case studies such as a payment system, flash sale, notification service, unique ID generator, Gmail, Reddit, Google Calendar and a code judging system, then goes beneath them with patterns like quorum, write-ahead logs and vector clocks and deep dives into Dynamo, Cassandra, Kafka, Chubby, HDFS, GFS and BigTable.

• System design
• Backend
• Job search

A quick-revision companion to the DSA roadmap in nine chapters: complexity, arrays and hashing, linked lists, stacks and queues, recursion, sorting and searching, trees and heaps, graphs, coding patterns, dynamic programming and timed practice habits. Costs are stated for every structure and algorithm, in Python, Java, C++ or JavaScript editions. Use it after each roadmap stage and before a contest or coding round.

• Programming
• DSA
• Web