Senior Technical Support Engineer - Spanish

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

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

The original Grokking system design course, which made the design round learnable. It teaches a repeatable interview approach and the key trade-offs (SQL versus NoSQL, strong versus eventual consistency, REST versus RPC and more), then works through 15 classic designs such as a URL shortener, Instagram, Dropbox, Twitter, YouTube, a rate limiter, a web crawler, Uber and Ticketmaster, each with requirements, estimates and trade-off discussion.

• System design
• Job search
• Backend

A very large site of articles on data structures, algorithms and core CS subjects such as operating systems, DBMS, computer networks and OOP, usually with code in several languages, plus practice problems and paid courses. It is handy for revising a university topic or finding a worked example of a specific algorithm. Quality varies because much is community written, so cross-check anything surprising against a textbook or official documentation.

• DSA
• CS fundamentals
• Databases

MIT's full undergraduate algorithms course from Spring 2020, free on OpenCourseWare with lecture videos, notes, problem sets, quizzes and exams with solutions, taught in Python by Erik Demaine, Jason Ku and Justin Solomon. It covers data structures, sorting, hashing, trees, graph search, shortest paths and dynamic programming with the reasoning behind each, which is what lets the ideas transfer to new problems.

• DSA
• CS fundamentals
• Programming