# Crush the FAANG Interview > Technical software engineering (SWE) interview preparation platform built by a former Amazon software engineer. Includes 80 narrated HD video lessons (36+ hours), structured study guides, and an in-browser Python 3.14 coding workspace with 540 verified test suites across 28 coding interview patterns and 52 system design & GenAI architecture video lessons. Recurring memberships: Monthly ($69/month), 3-Month ($149 every 3 months — $49.67/mo equivalent), and Annual ($299/year — $24.92/mo equivalent), plus 50% off for verified university students (SheerID / .edu). Enrollment is open. Self-serve 1-click end-of-period cancellation via Creem. ## Primary Resources & Machine-Readable Endpoints - [Platform Overview](https://crushthefaanginterview.com/): Interactive coding pattern triage, system design path tracer, and syllabus search. - [Engineering Interview Blog](https://crushthefaanginterview.com/blog): First-principles guides on coding patterns, capacity estimation, payment ledgers, geo-dispatch, and GenAI architecture. - [Video Lesson Catalog](https://crushthefaanginterview.com/courses): All 80 video lessons organized across Coding Patterns and System Design & AI. - [Python 3.14 Problem Workspace](https://crushthefaanginterview.com/workspace): Browser-executable index of all 540 coding interview problems. - [Subscription Plans & Student Discount](https://crushthefaanginterview.com/pricing): Monthly ($69), 3-Month ($149), and Annual ($299) plan comparison. - [Contact & Support](https://crushthefaanginterview.com/support): Submit a support ticket or email support@crushthefaanginterview.com (answered daily during US business hours, 9:00 AM ET – 6:00 PM PT). - [Full 80-Lesson Syllabus (Markdown)](https://crushthefaanginterview.com/llms-full.txt): Complete lesson titles, durations, and all 739 problem/design topics. - [Agent JSON Manifest](https://crushthefaanginterview.com/.well-known/agent.json): Structured JSON metadata for AI agents and search crawlers. - [RSS 2.0 Feed](https://crushthefaanginterview.com/feed.xml): Syndicated feed of engineering interview guides. ## Engineering Interview Playbooks (HTML + Raw Markdown) - [The 28 Coding Interview Patterns Cheat Sheet: Constraint-to-Algorithm Mapping for FAANG Loops](https://crushthefaanginterview.com/blog/28-coding-interview-patterns-cheat-sheet) ([Markdown](https://crushthefaanginterview.com/blog/28-coding-interview-patterns-cheat-sheet/md)): Stop memorizing 1,000 disconnected LeetCode solutions. Use input constraints, data properties, and output shapes to identify the exact optimal pattern in under 30 seconds. - [System Design Back-of-the-Envelope Calculations: QPS, Storage, Bandwidth & Latency Math](https://crushthefaanginterview.com/blog/system-design-back-of-the-envelope-estimation-guide) ([Markdown](https://crushthefaanginterview.com/blog/system-design-back-of-the-envelope-estimation-guide/md)): How to run clean 3-minute capacity estimates in L5 Senior and L6 Staff system design rounds—and use those numbers to justify sharding, caching, and queues. - [Design a Payment System Interview Guide: Idempotency Keys, Double-Entry Ledgers & Retries](https://crushthefaanginterview.com/blog/design-a-payment-system-idempotency-double-entry-ledger) ([Markdown](https://crushthefaanginterview.com/blog/design-a-payment-system-idempotency-double-entry-ledger/md)): A Staff-level walkthrough of payment processing interviews at Stripe, Amazon, Coinbase, and Uber: preventing double charges, state machines, and PSP webhook reconciliation. - [AI & LLM System Design Interview Guide: ChatGPT Streaming, KV-Cache Routing & Enterprise RAG](https://crushthefaanginterview.com/blog/ai-llm-system-design-interview-guide-chatgpt-rag) ([Markdown](https://crushthefaanginterview.com/blog/ai-llm-system-design-interview-guide-chatgpt-rag/md)): How to pass the modern GenAI architecture round at OpenAI, Anthropic, Meta, and Google: TTFT vs. TPOT budgets, continuous batching, hybrid vector search, and guardrails. - [How to Crack the Meta E5 SWE Onsite Loop: 45-Minute Double-Medium Sprints & Feed Architecture](https://crushthefaanginterview.com/blog/meta-e5-coding-and-system-design-interview-prep) ([Markdown](https://crushthefaanginterview.com/blog/meta-e5-coding-and-system-design-interview-prep/md)): Inside Meta's E4/E5 technical loop: executing two bug-free optimal problems in 40 minutes without running code, plus Product and Infrastructure system design expectations. - [Passing the Amazon SDE2 / SDE3 & Bar Raiser Loop: Failure Modes, Queues & Operational Rigor](https://crushthefaanginterview.com/blog/amazon-sde2-sde3-bar-raiser-system-design-guide) ([Markdown](https://crushthefaanginterview.com/blog/amazon-sde2-sde3-bar-raiser-system-design-guide/md)): How Amazon interviewers and Bar Raisers grade coding maintainability, distributed system resilience, SQS/Kafka backpressure, and Leadership Principle depth. - [Google L4 / L5 SWE Interview Playbook: Graph Modeling, Dynamic Programming & Global Storage](https://crushthefaanginterview.com/blog/google-l4-l5-algorithms-and-distributed-systems-prep) ([Markdown](https://crushthefaanginterview.com/blog/google-l4-l5-algorithms-and-distributed-systems-prep/md)): How to handle disguised algorithmic prompts in Google coding loops—where standard patterns hide behind novel domain stories—plus L5+ infrastructure design. - [Design Uber System Design Walkthrough: Geohash vs. Quadtree Spatial Indexing & Dispatch Matching](https://crushthefaanginterview.com/blog/design-uber-real-time-geo-dispatch-architecture) ([Markdown](https://crushthefaanginterview.com/blog/design-uber-real-time-geo-dispatch-architecture/md)): How to architect a 500,000-write/sec real-time location ingestion pipeline, spatial driver lookup index, and atomic ride-matching state machine. ## Company SWE Loop Roadmaps - **Meta** (Suggested Focus: 2 Coding Rounds (2 problems per 45m) + 1–2 Product/Infra System Design Rounds): Meta coding screens reward solving two medium-to-hard problems in 40 minutes with clean dry runs. System design loops focus on high-fanout feeds, messaging, and caching. - **Amazon** (Suggested Focus: Online Assessment + 3 Coding Rounds + System Design & Bar Raiser): Amazon emphasizes clean data structure choices (heaps, graphs, trees, sliding windows) and operational reliability: queues, rate limiting, and idempotent payment/order workflows. - **Google** (Suggested Focus: Phone Screen + 3–4 Algorithms Rounds + L5+ Distributed System Design): Google tests first-principles problem solving across graphs, dynamic programming, tries, and binary search on answer spaces, plus global storage and coordination systems. - **OpenAI & Anthropic** (Suggested Focus: Practical Coding + Distributed Infrastructure & AI/LLM System Design): Frontier AI teams evaluate distributed systems fundamentals alongside token streaming, GPU inference batching, KV-cache routing, RAG pipelines, and rate limiting. - **Stripe & Coinbase** (Suggested Focus: Practical Coding + API Integration + High-Reliability Ledger Design): Fintech engineering loops emphasize data correctness, idempotency keys, retry safety, double-entry ledgers, webhook delivery guarantees, and rate limiting. - **Uber & DoorDash** (Suggested Focus: 2 Coding Rounds + 1–2 Real-Time Geo & Marketplace Design Rounds): Real-time marketplace interviews focus on spatial indexing, high-frequency GPS ingestion, dispatch matching, pub-sub event streams, and distributed caching. ## [Coding patterns](https://crushthefaanginterview.com/courses/coding-patterns) Practice data structures and algorithms for your SWE coding interview. Solve 3Sum with two pointers, clone a graph and work through dynamic programming problems. (28 courses). ### [01. Two Pointers](https://crushthefaanginterview.com/course/gtci-01-two-pointers) Duration: 100 minutes. Covered Problems: Valid Palindrome, 3Sum, Remove Nth Node from End of List, Sort Colors, Reverse Words in a String, Valid Word Abbreviation, Strobogrammatic Number, Minimum Number of Moves to Make Palindrome, Next Palindrome Using Same Digits, Lowest Common Ancestor of a Binary Tree III, Count Pairs Whose Sum is Less than Target, Count Subarrays With Fixed Bounds, Get the Maximum Score, Find the Lexicographically Largest String From Box II, Create Maximum Number, Append Characters to String to Make Subsequence, Squares of a Sorted Array, Reverse String, Intersection of Two Linked Lists, Remove Element, String Compression, Partition Labels, Next Permutation, Rotate Array, Remove Duplicates from Sorted Array, Is Subsequence, Reverse Vowels of a String, Merge Strings Alternately, Compare Version Numbers, Valid Palindrome II, Move Zeroes, Backspace String Compare, Next Greater Element III, Rotating the Box. ### [02. Fast and Slow Pointers](https://crushthefaanginterview.com/course/gtci-02-fast-and-slow-pointers) Duration: 32 minutes. Covered Problems: Happy Number, Linked List Cycle, Middle of the Linked List, Circular Array Loop, Find the Duplicate Number, Palindrome Linked List, Maximum Twin Sum of a Linked List, Split a Circular Linked List, Linked List Cycle III, Linked List Cycle IV. ### [03. Sliding Window](https://crushthefaanginterview.com/course/gtci-03-sliding-window) Duration: 68 minutes. Covered Problems: Repeated DNA Sequences, Sliding Window Maximum, Minimum Window Subsequence, Longest Repeating Character Replacement, Minimum Window Substring, Longest Substring without Repeating Characters, Minimum Size Subarray Sum, Maximum Average Subarray I, Diet Plan Performance, Fruit Into Baskets, Contains Duplicate II, Frequency of the Most Frequent Element, Subarrays with K Different Integers, Count Subarrays With Score Less Than K, Count Substrings With K-Frequency Characters II, Substring with Concatenation of All Words, Binary Subarrays With Sum, Permutation in String, Number of Substrings Containing All Three Characters, Longest Subarray of 1's After Deleting One Element, Find the Index of the First Occurrence in a String, Max Consecutive Ones III, Longest Subarray With Diff At Most Limit, Subarray Product Less Than K. ### [04. Intervals](https://crushthefaanginterview.com/course/gtci-04-intervals) Duration: 32 minutes. Covered Problems: Merge Intervals, Insert Interval, Interval List Intersections, Employee Free Time, Count Days Without Meetings, Remove Covered Intervals, Car Pooling, Data Stream as Disjoint Intervals, Minimum Interval to Include Each Query, Meeting Rooms II. ### [05. In-Place Manipulation of a Linked List](https://crushthefaanginterview.com/course/gtci-05-in-place-manipulation-of-a-linked-list) Duration: 42 minutes. Covered Problems: Reverse Linked List, Reverse Nodes in k-Group, Reverse Linked List II, Reorder List, Swapping Nodes in a Linked List, Reverse Nodes in Even Length Groups, Remove Duplicates from Sorted List, Remove Linked List Elements, Split Linked List in Parts, Delete N Nodes After M Nodes of a Linked List, Insert into a Sorted Circular Linked List, Odd Even Linked List, Rotate List, Swap Nodes in Pairs. ### [06. Heaps](https://crushthefaanginterview.com/course/gtci-06-heaps) Duration: 39 minutes. Covered Problems: IPO, Find Median from Data Stream, Sliding Window Median, Schedule Tasks on Minimum Machines, Meeting Rooms III, Largest Number After Digit Swaps by Parity, Find Right Interval, Minimum Cost to Connect Sticks, Longest Happy String, Maximum Average Pass Ratio, The Number of the Smallest Unoccupied Chair, Construct Target Array With Multiple Sums. ### [07. K-way Merge](https://crushthefaanginterview.com/course/gtci-07-k-way-merge) Duration: 22 minutes. Covered Problems: Merge Sorted Array, Kth Smallest Number in M Sorted Lists, Find K Pairs with Smallest Sums, Merge K Sorted Lists, Kth Smallest Element in a Sorted Matrix, Kth Smallest Prime Fraction, Super Ugly Number. ### [08. Top K Elements](https://crushthefaanginterview.com/course/gtci-08-top-k-elements) Duration: 59 minutes. Covered Problems: Kth Largest Element in a Stream, Reorganize String, K Closest Points to Origin, Top K Frequent Elements, Kth Largest Element in an Array, Third Maximum Number, Find Subsequence of Length K with the Largest Sum, Minimum Cost to Hire K Workers, Maximal Score After Applying K Operations, Find the Kth Largest Integer in the Array, Maximum Performance of a Team, Smallest Range Covering Elements from K Lists, K Maximum Sum Combinations From Two Arrays, K Empty Slots, Maximum Product After K Increments, Find the K-Sum of an Array, Least Number of Unique Integers after K Removals, Final Array State After K Multiplication Operations I. ### [09. Modified Binary Search](https://crushthefaanginterview.com/course/gtci-09-modified-binary-search) Duration: 72 minutes. Covered Problems: Binary Search, Search in Rotated Sorted Array, First Bad Version, Random Pick with Weight, Find K Closest Elements, Single Element in a Sorted Array, Maximum Value at a Given Index in a Bounded Array, The K Weakest Rows in a Matrix, Split Array Largest Sum, Find Minimum in Rotated Sorted Array II, Maximum Running Time of N Computers, Minimize Max Distance to Gas Station, Divide Chocolate, Split Array Into Two Arrays to Minimize Sum Difference, Number of Flowers in Full Bloom, Koko Eating Bananas, Search Insert Position, Find Peak Element, Find First and Last Position of Element in Sorted Array, Search in Rotated Sorted Array II, Kth Smallest Product of Two Sorted Arrays, Sqrt(x), Reaching Points, Kth Missing Positive Number. ### [10. Subsets](https://crushthefaanginterview.com/course/gtci-10-subsets) Duration: 26 minutes. Covered Problems: Subsets, Permutations, Letter Combinations of a Phone Number, Generate Parentheses, Letter Case Permutation, Letter Tile Possibilities, Subsets II, Find K-Sum Subsets. ### [11. Greedy Techniques](https://crushthefaanginterview.com/course/gtci-11-greedy-techniques) Duration: 73 minutes. Covered Problems: Jump Game, Boats to Save People, Gas Station, Two City Scheduling, Minimum Number of Refueling Stops, Largest Palindromic Number, Assign Cookies, Rearranging Fruits, Number of Steps to Reduce a Binary Number to One, Maximum Swap, Can Place Flowers, Largest Odd Number in String, Candy, Minimum Replacements to Sort the Array, Sort an Array, Text Justification, Largest Number, Best Time to Buy and Sell Stock II, Wildcard Matching, Remove K Digits, Strong Password Checker, Jump Game II, Best Time to Buy and Sell Stock, Maximum Points After Enemy Battles, Integer to Roman. ### [12. Backtracking](https://crushthefaanginterview.com/course/gtci-12-backtracking) Duration: 62 minutes. Covered Problems: N-Queens II, Word Search, House Robber III, Restore IP Addresses, Flood Fill, Minimum Moves to Spread Stones Over Grid, Binary Tree Paths, Binary Watch, Optimal Account Balancing, Split a String Into the Max Number of Unique Substrings, All Paths From Source to Target, Remove Invalid Parentheses, N-Queens, Unique Paths III, Combinations, Word Ladder II, Flip Game, Additive Number, Sudoku Solver, Matchsticks to Square. ### [13. Dynamic Programming](https://crushthefaanginterview.com/course/gtci-13-dynamic-programming) Duration: 123 minutes. Covered Problems: 0/1 Knapsack, Coin Change, N-th Tribonacci Number, Partition Equal Subset Sum, Counting Bits, 01 Matrix, House Robber II, Maximum Product Subarray, Combination Sum, Word Break, Palindromic Substrings, Longest Common Subsequence, Word Break II, Decode Ways, Count the Number of Good Subsequences, Binary Tree Cameras, Number of Ways to Form Target String Given a Dictionary, Pascal's Triangle, Triangle, Frog Jump, Cherry Pickup, Dungeon Game, Burst Balloons, Regular Expression Matching, Shortest Common Supersequence, Interleaving String, Maximal Rectangle, Longest Increasing Path in a Matrix, Min Cost Climbing Stairs, Number of Longest Increasing Subsequence, Distinct Subsequences, Cheapest Flights Within K Stops, Minimum Path Sum, Best Time to Buy and Sell Stock III, Maximal Square, The Number of Good Subsets, Freedom Trail, Soup Servings, Number of People Aware of a Secret, Climbing Stairs, Edit Distance. ### [14. Cyclic Sort](https://crushthefaanginterview.com/course/gtci-14-cyclic-sort) Duration: 20 minutes. Covered Problems: Cyclic Sort, Missing Number, First Missing Positive, Find the Corrupt Pair, Sort Array By Parity II, Find the First K Missing Positive Numbers. ### [15. Topological Sort](https://crushthefaanginterview.com/course/gtci-15-topological-sort) Duration: 38 minutes. Covered Problems: Compilation Order, Alien Dictionary, Verifying an Alien Dictionary, Course Schedule II, Course Schedule, Build a Matrix with Conditions, Longest Path With Different Adjacent Characters, Parallel Courses III, Parallel Courses, Sort Items by Groups Respecting Dependencies, Find All Possible Recipes from Given Supplies, Collect Coins in a Tree. ### [16. Sort and Search](https://crushthefaanginterview.com/course/gtci-16-sort-and-search) Duration: 57 minutes. Covered Problems: Find the Distance Value Between Two Arrays, Longest Subsequence With Limited Sum, Find Target Indices After Sorting Array, Count Pairs in Two Arrays, Valid Triangle Number, Minimum Operations to Make All Array Elements Equal, Sum of Mutated Array Closest to Target, Range Sum of Sorted Subarray Sums, Magnetic Force Between Two Balls, Find K-th Smallest Pair Distance, Minimum Space Wasted from Packaging, Russian Doll Envelopes, Put Marbles in Bags, H-Index, Reverse Pairs, Two Sum Less Than K, Maximum Number of Integers to Choose from a Range I, Minimum Time Difference. ### [17. Matrices](https://crushthefaanginterview.com/course/gtci-17-matrices) Duration: 62 minutes. Covered Problems: Set Matrix Zeroes, Rotate Image, Spiral Matrix, Where Will the Ball Fall, Transpose Matrix, Count Negative Numbers in a Sorted Matrix, Minimum Time Takes to Reach Destination Without Drowning, Smallest Rectangle Enclosing Black Pixels, Island Perimeter, Convert 1D Array Into 2D Array, Spiral Matrix II, Flip Columns For Maximum Number of Equal Rows, Number of Spaces Cleaning Robot Cleaned, Minimize Maximum Value in a Grid, Kth Smallest Number in Multiplication Table, Swim in Rising Water, Best Meeting Point, Game of Life, Toeplitz Matrix, Diagonal Traverse. ### [18. Stacks](https://crushthefaanginterview.com/course/gtci-18-stacks) Duration: 62 minutes. Covered Problems: Basic Calculator, Remove All Adjacent Duplicates In String, Minimum Remove to Make Valid Parentheses, Exclusive Time of Functions, Flatten Nested List Iterator, Implement Queue Using Stacks, Daily Temperatures, Decode String, Minimum String Length After Removing Substrings, Number of Valid Subarrays, Number of Visible People in a Queue, Parsing a Boolean Expression, Remove Duplicate Letters, Longest Valid Parentheses, Next Greater Element IV, Valid Parentheses, Maximum Width Ramp, Remove All Adjacent Duplicates in String II, Basic Calculator II, Simplify Path. ### [19. Graphs](https://crushthefaanginterview.com/course/gtci-19-graphs) Duration: 57 minutes. Covered Problems: Network Delay Time, Paths in Maze That Lead to Same Room, Clone Graph, Graph Valid Tree, Bus Routes, Reconstruct Itinerary, Find the Town Judge, Find Center of Star Graph, Lucky Numbers in a Matrix, Path with Maximum Probability, Tree Diameter, Reorder Routes to Make All Paths Lead to the City Zero, Minimum Cost to Make at Least One Valid Path in a Grid, Longest Cycle in a Graph, Shortest Cycle in a Graph, Shortest Path Visiting All Nodes, Max Area of Island, Shortest Path in a Grid with Obstacles Elimination. ### [20. Tree Depth-First Search](https://crushthefaanginterview.com/course/gtci-20-tree-depth-first-search) Duration: 67 minutes. Covered Problems: Flatten Binary Tree to Linked List, Diameter of Binary Tree, Serialize and Deserialize Binary Tree, Invert Binary Tree, Binary Tree Maximum Path Sum, Convert Sorted Array to Binary Search Tree, Build Binary Tree from Preorder and Inorder Traversal, Binary Tree Right Side View, Lowest Common Ancestor of a Binary Tree, Validate Binary Search Tree, Nested List Weight Sum II, Inorder Successor in BST, Height of Binary Tree After Subtree Removal Queries, Delete Nodes And Return Forest, Sum of Distances in a Tree, Recover a Tree From Preorder Traversal, Binary Tree Preorder Traversal, Univalued Binary Tree, Path Sum, Closest Binary Search Tree Value, Kth Smallest Element in a BST, Maximum Depth of Binary Tree. ### [21. Tree Breadth-First Search](https://crushthefaanginterview.com/course/gtci-21-tree-breadth-first-search) Duration: 43 minutes. Covered Problems: Binary Tree Level Order Traversal, Binary Tree Zigzag Level Order Traversal, Populating Next Right Pointers in Each Node, Vertical Order Traversal of a Binary Tree, Symmetric Tree, Word Ladder, Two Sum IV - Input Is a BST, Find Minimum Diameter After Merging Two Trees, Closest Node to Path in Tree, Frog Position After T Seconds, Average of Levels in Binary Tree, Open the Lock, Connect All Siblings of a Binary Tree, Shortest Distance from All Buildings. ### [22. Trie](https://crushthefaanginterview.com/course/gtci-22-trie) Duration: 44 minutes. Covered Problems: Implement Trie (Prefix Tree), Search Suggestions System, Replace Words, Design Add and Search Words Data Structure, Word Search II, Top K Frequent Words, Longest Common Prefix, Index Pairs of a String, K-th Smallest in Lexicographical Order, Palindrome Pairs, Longest Common Suffix Queries, Map Sum Pairs, Check If a Word is a Prefix of Any Word in a Sentence, Longest Word With All Prefixes, Lexicographical Numbers. ### [23. Hash Maps](https://crushthefaanginterview.com/course/gtci-23-hash-maps) Duration: 99 minutes. Covered Problems: Design HashMap, Fraction to Recurring Decimal, Logger Rate Limiter, Next Greater Element I, Isomorphic Strings, Find Duplicate File in System, Dot Product of Two Sparse Vectors, High Five, Bulls and Cows, Custom Sort String, Number of Distinct Islands, Number of Wonderful Substrings, Total Appeal of a String, Continuous Subarray Sum, Unique Number of Occurrences, Longest Happy Prefix, Find Longest Self-Contained Substring, Intersection of Two Arrays, Word Pattern, Valid Sudoku, Roman to Integer, Contiguous Array, Jewels and Stones, Vowel Spellchecker, N-Repeated Element in Size 2N Array, Powerful Integers, Before and After Puzzle, Intersection of Two Arrays II, Subarray Sum Equals K, Longest Palindrome, Identify the Largest Outlier in an Array, Find the Length of the Longest Common Prefix. ### [24. Knowing What to Track](https://crushthefaanginterview.com/course/gtci-24-knowing-what-to-track) Duration: 74 minutes. Covered Problems: Palindrome Permutation, Valid Anagram, Design Tic-Tac-Toe, Group Anagrams, Maximum Frequency Stack, First Unique Character in a String, Find All Anagrams in a String, Longest Palindrome by Concatenating Two-Letter Words, Rank Teams by Votes, Pairs of Songs With Total Durations Divisible by 60, Minimum Number of Pushes to Type Word II, Task Scheduler, Count Anagrams, Divide Array Into Increasing Sequences, Max Consecutive Ones, Count and Say, Ransom Note, Find Words That Can Be Formed by Characters, Check if One String Swap Can Make Strings Equal, Find Pivot Index, Sort Array by Increasing Frequency, Concatenation of Array, Zigzag Conversion, Zero Array Transformation I, Count Binary Substrings. ### [25. Union Find](https://crushthefaanginterview.com/course/gtci-25-union-find) Duration: 42 minutes. Covered Problems: Redundant Connection, Number of Islands, Most Stones Removed with Same Row or Column, Longest Consecutive Sequence, Last Day Where You Can Still Cross, Regions Cut by Slashes, Accounts Merge, Minimize Malware Spread, Find if Path Exists in Graph, The Skyline Problem, Similar String Groups, Optimize Water Distribution in a Village, Number of Islands II, Evaluate Division. ### [26. Custom Data Structures](https://crushthefaanginterview.com/course/gtci-26-custom-data-structures) Duration: 49 minutes. Covered Problems: Snapshot Array, Time Based Key-Value Store, LRU Cache, Insert Delete GetRandom O(1), Min Stack, Range Module, Shortest Word Distance II, Design HashSet, Max Stack, Moving Average from Data Stream, Two Sum III - Data structure design, Range Sum Query - Immutable, Stream of Characters, All O`one Data Structure, Finding MK Average, LFU Cache. ### [27. Bitwise Manipulation](https://crushthefaanginterview.com/course/gtci-27-bitwise-manipulation) Duration: 53 minutes. Covered Problems: Find the Difference, Complement of Base 10 Integer, Flipping an Image, Single Number, Single Number II, Encode and Decode Strings, Sum of All Subset XOR Totals, Find The K-th Lucky Number, Minimum Number of K Consecutive Bit Flips, Find the Longest Substring Having Vowels in Even Counts, Count Triplets That Can Form Two Arrays of Equal XOR, Longest Subarray With Maximum Bitwise AND, Minimum One Bit Operations to Make Integers Zero, Triples with Bitwise AND Equal To Zero, Power of Two, Hamming Distance, Minimum Operations to Make the Integer Zero, Reverse Bits. ### [28. Math and Geometry](https://crushthefaanginterview.com/course/gtci-28-math-and-geometry) Duration: 129 minutes. Covered Problems: Check If It Is a Straight Line, Minimum Cuts to Divide a Circle, Rectangle Overlap, Minimum Time Visiting All Points, Reverse Integer, Valid Square, Rectangle Area, Minimum Area Rectangle, Maximum Area Rectangle With Point Constraints I, Convex Polygon, Queries on Number of Points Inside a Circle, Max Points on a Line, Maximum Number of Visible Points, Minimize Manhattan Distances, Self Crossing, Erect the Fence, Minimum Number of Lines to Cover Points, Nth Magical Number, Add Strings, Integer to English Words, Fibonacci Number, Palindrome Number, Perfect Squares, Plus One, Add Two Numbers, Confusing Number, Bulb Switcher, Water and Jug Problem, Poor Pigs, Nim Game, Detonate the Maximum Bombs, Add to Array-Form of Integer, Equal Rational Numbers, Count Substrings with Only One Distinct Letter, Adding Two Negabinary Numbers, Greatest Common Divisor of Strings, Power of Three, Base 7, Sum of k-Mirror Numbers, Sum of Squares of Special Elements, Add Digits, Count Primes, Pow(x, n). ## [System design](https://crushthefaanginterview.com/courses/system-design) Prepare for a system design interview. Estimate traffic, choose where to cache data and explain how you would design YouTube, Uber or a payment system. (52 courses). ### [01. Introduction](https://crushthefaanginterview.com/course/sd-01-introduction) Duration: 5 minutes. Covered Topics: Introduction to Modern System Design, Why Every Developer Should Learn System Design, Course Structure for Modern System Design. ### [02. System Design Interviews](https://crushthefaanginterview.com/course/sd-02-system-design-interviews) Duration: 9 minutes. Covered Topics: Getting Ready for the System Design Interview, The Do's and Don'ts of the System Design Interview, System Design Interview Trap: Why Engineers Fail and Succeed, How Long Does It Take to Prepare for a System Design Interview?, How AI Reshaped System Design and Interviews, How Roles and Tools Reshaped the System Design Interview. ### [03. Preliminary System Design Concepts](https://crushthefaanginterview.com/course/sd-03-preliminary-system-design-concepts) Duration: 7 minutes. Covered Topics: Abstractions in System Design, Network Abstractions: Remote Procedure Calls, Spectrum of Consistency Models, The Spectrum of Failure Models. ### [04. Non-Functional System Characteristics](https://crushthefaanginterview.com/course/sd-04-non-functional-system-characteristics) Duration: 9 minutes. Covered Topics: Availability, Reliability, Scalability, Maintainability, Fault Tolerance, Non-Functional Requirements for System Design Interviews. ### [05. Back-of-the-Envelope Calculations](https://crushthefaanginterview.com/course/sd-05-back-of-the-envelope-calculations) Duration: 8 minutes. Covered Topics: Put Back-of-the-Envelope Numbers in Perspective, Examples of Resource Estimation. ### [06. Building Blocks](https://crushthefaanginterview.com/course/sd-06-building-blocks) Duration: 4 minutes. Covered Topics: Introduction to Building Blocks for Modern System Design. ### [07. Domain Name System](https://crushthefaanginterview.com/course/sd-07-domain-name-system) Duration: 6 minutes. Covered Topics: Introduction to Domain Name System (DNS), How the Domain Name System Works. ### [08. Load Balancers](https://crushthefaanginterview.com/course/sd-08-load-balancers) Duration: 5 minutes. Covered Topics: Introduction to Load Balancers, Global and Local Load Balancing, Advanced Details of Load Balancers. ### [09. Databases](https://crushthefaanginterview.com/course/sd-09-databases) Duration: 8 minutes. Covered Topics: Introduction to Databases, Types of Databases, Data Replication, Data Partitioning, Trade-Offs in Databases. ### [10. Key-Value Store](https://crushthefaanginterview.com/course/sd-10-key-value-store) Duration: 16 minutes. Covered Topics: System Design: The Key-Value Store, Design of a Key-Value Store, Ensure Scalability and Replication, Versioning Data and Achieving Configurability, Enable Fault Tolerance and Failure Detection. ### [11. Content Delivery Network (CDN)](https://crushthefaanginterview.com/course/sd-11-content-delivery-network-cdn) Duration: 16 minutes. Covered Topics: System Design: The Content Delivery Network (CDN), Introduction to a CDN, Design of a CDN, In-Depth Investigation of CDN: Part 1, In-Depth Investigation of CDN: Part 2, Evaluation of CDN's Design. ### [12. Sequencer](https://crushthefaanginterview.com/course/sd-12-sequencer) Duration: 7 minutes. Covered Topics: System Design: Sequencer, Design of a Unique ID Generator, Unique IDs with Causality. ### [13. Distributed Monitoring](https://crushthefaanginterview.com/course/sd-13-distributed-monitoring) Duration: 6 minutes. Covered Topics: System Design: Distributed Monitoring, Introduction to Distributed Monitoring, Prerequisites of a Monitoring System. ### [14. Monitor Server-Side Errors](https://crushthefaanginterview.com/course/sd-14-monitor-server-side-errors) Duration: 7 minutes. Covered Topics: Design of a Monitoring System, Detailed Design of a Monitoring System, Visualize Data in a Monitoring System. ### [15. Monitor Client-Side Errors](https://crushthefaanginterview.com/course/sd-15-monitor-client-side-errors) Duration: 4 minutes. Covered Topics: Focus on Client-Side Errors in a Monitoring System, Design of a Client-Side Monitoring System. ### [16. Distributed Cache](https://crushthefaanginterview.com/course/sd-16-distributed-cache) Duration: 11 minutes. Covered Topics: System Design: The Distributed Cache, Background of Distributed Cache, High-Level Design of a Distributed Cache, Detailed Design of a Distributed Cache, Evaluation of a Distributed Cache's Design, Memcached versus Redis. ### [17. Distributed Messaging Queue](https://crushthefaanginterview.com/course/sd-17-distributed-messaging-queue) Duration: 13 minutes. Covered Topics: System Design: The Distributed Messaging Queue, Requirements of a Distributed Messaging Queue's Design, Considerations of a Distributed Messaging Queue's Design, Design of a Distributed Messaging Queue: Part 1, Design of a Distributed Messaging Queue: Part 2, Evaluation of a Distributed Messaging Queue's Design. ### [18. Pub-Sub](https://crushthefaanginterview.com/course/sd-18-pub-sub) Duration: 11 minutes. Covered Topics: System Design: The Pub-Sub Abstraction, Introduction to Pub-Sub, Design of a Pub-Sub System. ### [19. Rate Limiter](https://crushthefaanginterview.com/course/sd-19-rate-limiter) Duration: 11 minutes. Covered Topics: System Design: The Rate Limiter, Requirements of a Rate Limiter's Design, Design of a Rate Limiter, Rate Limiter Algorithms. ### [20. Blob Store](https://crushthefaanginterview.com/course/sd-20-blob-store) Duration: 11 minutes. Covered Topics: System Design: A Blob Store, Requirements of a Blob Store's Design, Design of a Blob Store, Design Considerations of a Blob Store, Evaluation of a Blob Store's Design. ### [21. Distributed Search](https://crushthefaanginterview.com/course/sd-21-distributed-search) Duration: 11 minutes. Covered Topics: System Design: The Distributed Search, Requirements of a Distributed Search System's Design, Indexing in a Distributed Search, Design of a Distributed Search, Scaling Search and Indexing, Evaluation of a Distributed Search's Design. ### [22. Distributed Logging](https://crushthefaanginterview.com/course/sd-22-distributed-logging) Duration: 9 minutes. Covered Topics: System Design: Distributed Logging, Introduction to Distributed Logging, Design of a Distributed Logging Service. ### [23. Distributed Task Scheduler](https://crushthefaanginterview.com/course/sd-23-distributed-task-scheduler) Duration: 11 minutes. Covered Topics: System Design: The Distributed Task Scheduler, Requirements of a Distributed Task Scheduler's Design, Design of a Distributed Task Scheduler, Design Considerations of a Distributed Task Scheduler, Evaluation of a Distributed Task Scheduler's Design. ### [24. Sharded Counters](https://crushthefaanginterview.com/course/sd-24-sharded-counters) Duration: 6 minutes. Covered Topics: System Design: The Sharded Counters, High-Level Design of Sharded Counters, Detailed Design of Sharded Counters. ### [25. AI Building Blocks for System Design](https://crushthefaanginterview.com/course/sd-25-ai-building-blocks-for-system-design) Duration: 11 minutes. Covered Topics: Models as Components in a System, Ranking, Prediction, and Classification Pipelines, Tokens, Context Windows, and Generation, Embeddings and Retrieval, Retrieval-Augmented Generation, Serving Models within Latency and Cost Budgets, Evaluating and Protecting AI Features. ### [26. Concluding the Building Blocks Discussion](https://crushthefaanginterview.com/course/sd-26-concluding-the-building-blocks-discussion) Duration: 9 minutes. Covered Topics: Wrapping Up the Building Blocks Discussion, The RESHADED Approach for System Design. ### [27. Design YouTube](https://crushthefaanginterview.com/course/sd-27-design-youtube) Duration: 19 minutes. Covered Topics: System Design: YouTube, Requirements of YouTube's Design, Design of YouTube, Ask YouTube: AI-Powered Conversational Video Discovery, Evaluation of YouTube's Design, The Reality Is More Complicated. ### [28. Design Quora](https://crushthefaanginterview.com/course/sd-28-design-quora) Duration: 12 minutes. Covered Topics: System Design: Quora, Requirements of Quora's Design, Initial Design of Quora, Final Design of Quora, Evaluation of Quora's Design. ### [29. Design Google Maps](https://crushthefaanginterview.com/course/sd-29-design-google-maps) Duration: 13 minutes. Covered Topics: System Design: Google Maps, Requirements of Google Maps Design, Design of Google Maps, Challenges of Google Maps' Design, Detailed Design of Google Maps, Evaluation of Google Maps' Design. ### [30. Design a Proximity Service/Yelp](https://crushthefaanginterview.com/course/sd-30-design-a-proximity-service) Duration: 13 minutes. Covered Topics: System Design: Yelp, Requirements of Yelp's Design, Design of Yelp, Design Considerations of Yelp. ### [31. Design Uber](https://crushthefaanginterview.com/course/sd-31-design-uber) Duration: 14 minutes. Covered Topics: System Design: Uber, Requirements of Uber's Design, High-level Design of Uber, Detailed Design of Uber, Payment Service and Fraud Detection in Uber Design, Evaluation of Uber's Design. ### [32. Design Twitter](https://crushthefaanginterview.com/course/sd-32-design-twitter) Duration: 17 minutes. Covered Topics: System Design: Twitter, Requirements of Twitter's Design, High-level Design of Twitter, Detailed Design of Twitter, Client-side Load Balancer for Twitter. ### [33. Design Newsfeed System](https://crushthefaanginterview.com/course/sd-33-design-newsfeed-system) Duration: 14 minutes. Covered Topics: System Design: Newsfeed System. ### [34. Design Instagram](https://crushthefaanginterview.com/course/sd-34-design-instagram) Duration: 10 minutes. Covered Topics: System Design: Instagram, Requirements of Instagram's Design, Design of Instagram, Detailed Design of Instagram. ### [35. Design a URL Shortening Service/TinyURL](https://crushthefaanginterview.com/course/sd-35-design-a-url-shortening-service) Duration: 15 minutes. Covered Topics: System Design: TinyURL. ### [36. Design a Web Crawler](https://crushthefaanginterview.com/course/sd-36-design-a-web-crawler) Duration: 12 minutes. Covered Topics: System Design: Web Crawler. ### [37. Design WhatsApp](https://crushthefaanginterview.com/course/sd-37-design-whatsapp) Duration: 14 minutes. Covered Topics: System Design: WhatsApp, Requirements of WhatsApp's Design, High-Level Design of WhatsApp, Detailed Design of WhatsApp, Evaluation of WhatsApp's Design. ### [38. Design Typeahead Suggestion](https://crushthefaanginterview.com/course/sd-38-design-typeahead-suggestion) Duration: 13 minutes. Covered Topics: System Design: The Typeahead Suggestion System, Requirements of the Typeahead Suggestion System's Design, High-Level Design of the Typeahead Suggestion System, Data Structure for Storing Prefixes, Detailed Design of the Typeahead Suggestion System, Evaluation of the Typeahead Suggestion System's Design. ### [39. Design a Collaborative Document Editing Service/Google Docs](https://crushthefaanginterview.com/course/sd-39-design-a-collaborative-document-editing-service) Duration: 13 minutes. Covered Topics: System Design: Google Docs, Requirements of Google Docs' Design, Design of Google Docs, Concurrency in Collaborative Editing, Evaluation of Google Docs' Design. ### [40. Design a Deployment System](https://crushthefaanginterview.com/course/sd-40-design-a-deployment-system) Duration: 12 minutes. Covered Topics: Introduction to Code Deployment System, Design of a Code Deployment System. ### [41. Design a Payment System](https://crushthefaanginterview.com/course/sd-41-design-a-payment-system) Duration: 13 minutes. Covered Topics: Introduction to the Payment System, Design of a Payment System. ### [42. Design a LeetCode System](https://crushthefaanginterview.com/course/sd-42-design-a-leetcode-system) Duration: 13 minutes. Covered Topics: Introduction to the LeetCode System, Design of the LeetCode System. ### [43. Design Google Calendar](https://crushthefaanginterview.com/course/sd-43-design-google-calendar) Duration: 14 minutes. Covered Topics: System Design: Google Calendar, Design of Google Calendar. ### [44. Design Metrics Monitoring and Alerting Systems](https://crushthefaanginterview.com/course/sd-44-design-metrics-monitoring-and-alerting-systems) Duration: 14 minutes. Covered Topics: System Design: Metrics Monitoring and Alerting System, Design of a Metrics Monitoring and Alerting System. ### [45. Design a ChatGPT System](https://crushthefaanginterview.com/course/sd-45-design-a-chatgpt-system) Duration: 15 minutes. Covered Topics: System Design: ChatGPT System, Design of a ChatGPT System. ### [46. Design a Data Infrastructure System](https://crushthefaanginterview.com/course/sd-46-design-a-data-infrastructure-system) Duration: 16 minutes. Covered Topics: System Design: Data Infrastructure for AI/ML Systems, High-Level Design of Scalable Data Infrastructure for AI/ML, Detailed Design of Scalable Data Infrastructure for AI/ML. ### [47. LLM-Powered Customer Support Bot System Design](https://crushthefaanginterview.com/course/sd-47-llm-powered-customer-support-bot-system-design) Duration: 18 minutes. Covered Topics: System Design: LLM-Powered Customer Support Bot, Design of an LLM-Powered Customer Support Bot. ### [48. AI-Powered Code Assistant System Design](https://crushthefaanginterview.com/course/sd-48-ai-powered-code-assistant-system-design) Duration: 17 minutes. Covered Topics: System Design: AI-Powered Code Assistant, System Design of an AI-Powered Code Assistant. ### [49. Lessons from System Failures](https://crushthefaanginterview.com/course/sd-49-lessons-from-system-failures) Duration: 7 minutes. Covered Topics: Lessons from System Failures, Facebook, WhatsApp, Instagram, Oculus Outage, AWS Kinesis Outage Affecting Many Organizations, AWS Wide Spread Outage. ### [50. Concluding Remarks](https://crushthefaanginterview.com/course/sd-50-concluding-remarks) Duration: 3 minutes. Covered Topics: Conclusions, Resources to Prepare for a System Design Interview. ### [51. Free System Design Lessons](https://crushthefaanginterview.com/course/sd-51-free-system-design-lessons) Duration: 14 minutes. Covered Topics: The All-in-One System Design Master Template, System Design Primer, Distributed Systems Considerations and Trade-Offs, Key Concepts to Prepare for the System Design Interview, Scalable Systems 101, Best Practices for Achieving Low Latency in System Design, Distributed System Design Patterns, System Analysis vs. System Design, API Design Interview vs. System Design Interview, Design Interview Guide: Low-level OOD to Advanced System Design. ### [52. System Design Case Studies](https://crushthefaanginterview.com/course/sd-52-system-design-case-studies) Duration: 8 minutes. Covered Topics: How Spotify Wrapped Scales for 7M Users, How Amazon Scales for Prime Day, How Twilio Builds for Scale, Dropbox System Design, Ticketmaster System Design.