Associate Technical Services Engineer II

A structured learning path through coding interview preparation that brings together data structures and algorithms fundamentals, recursion and the pattern-based approach to coding questions in one order. It totals 77 chapters and 1,054 lessons, with quizzes, flashcards and a certificate. Use it when you have plenty of material but no clear plan for what to study first.

• Job search
• DSA
• Career

A bundle of five company-specific question courses covering the problems most often reported from Meta, Microsoft, Amazon, Google and Oracle coding rounds, each split into easy, medium and hard sets with worked solutions. It suits candidates who already know the core patterns and have a loop booked at one of these companies, and want to rehearse on the questions those interviewers are known to ask.

• Job search
• DSA
• Career

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

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

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

An eight-stage path from Big-O through arrays, hashing, recursion, trees, graphs, coding patterns and dynamic programming to timed, mixed practice, in Python, Java, C++ or JavaScript. It suits students and developers who can write code but freeze on problems with no obvious library call. By the end you can pick the right data structure, recognise common problem shapes and solve a medium problem in about 35 minutes with edge cases tested.

• Programming
• DSA
• Web