Algo Master

Here is some concepts prepare for software enginneer interview

1. System Design

1.1. Introduction

1.2. Core Concepts

1.3. Databases & Storage

1.4. Database Scaling Techniques

1.5. Caching

1.6. Networking

1.7. APIs

1.8. Asynchronous Communications

1.9. Tradeoffs

1.10. Distributed System Concepts

1.11. Microservices

1.12. Big Data Processing

1.13. Architectural Patterns

1.14. Observability

1.15. Security

1.16. Interview Tips

1.17. Interview Questions

2. Company

2.1 Agoda

2.2 Airbnb

2.3 Amazon Science

2.4 Atlassian

2.5 Auth0

2.6 Booking.com

2.7 Canva

2.8 Coinbase

2.9 Discord

2.10 DoorDash

2.11 Dropbox

2.12 Ebay

2.13 Expedia

2.14 Facebook

2.15 Figma

2.16 Flipkart

2.17 GitHub

2.18 GoDaddy

2.19 Google Research

2.20 Grab

2.21 Gusto

2.22 HashNode

2.23 Hostinger

2.24 Hotstar

2.25 HubSpot

2.26. Instacart

2.27 Instagram

2.28 LinkedIn

2.29 Lyft

2.30 Medium

2.31 Netflix

2.32 Notion

2.33 PayPal

2.34 Pinterest

2.35 Quora

2.36 Razorpay

2.37 Reddit

2.38 Salesforce

2.39 Shopify

2.40 Slack

2.41 Snap

2.42 Spotify

2.43 Squarespace

2.44 Stripe

2.45 Swiggy

2.46. Target

2.47 Timescale

2.48 Tinder

2.49 Twitch

2.50 Uber

2.51 Vimeo

2.52 Walmart

2.53 Twitter (X)

2.54 Yelp

2.55 Zendesk

2.56 Zillow

2.57 Zomato

3. DSA

3.1 Arrays

3.2 Strings

3.3 Bit Manipulation

3.4 Hash Tables

3.5 Two Pointers

3.6 Prefix Sum

3.7 Sliding Window - Fixed Size

3.8 Sliding Window - Dynamic Size

3.9 Kadane’s Algorithm

3.10 Matrix (2D Array)

3.11 Linked List

3.12 LinkedList In-place Reversal

3.13 Fast and Slow Pointers

3.14 Stacks

3.15 Monotonic Stack

3.16 Queues

3.17 Monotonic Queue

3.18 Bucket Sort

3.19 Recursion

3.20 Divide and Conquer

3.21 Merge Sort

3.22 QuickSort / QuickSelect

3.24 Backtracking

3.25 Tree Traversal - Level Order

3.26 Tree Traversal - Pre Order

3.27 Tree Traversal - In Order

3.28 Tree Traversal - Post-Order

3.29 BST / Ordered Set

3.30 Tries

3.31 Heaps

3.32 Two Heaps

3.33 Top K Elements

3.34 Intervals

3.35 K-Way Merge

3.36 Data Structure Design

3.37 Greedy

3.38 Depth First Search (DFS)

3.39 Breadth First Search (BFS)

3.40 Topological Sort

3.41 Union Find

3.42 Minimum Spanning Tree

3.43 Shortest Path

3.44 Eulerian Circuit

3.45 1-D DP

3.46 Knapsack DP

3.47 Unbounded Knapsack DP

3.48 Longest Increasing Subsequence DP

3.49 2D (Grid) DP

3.50 String DP

3.51 Tree / Graph DP

3.52 Bitmask DP

3.53 Digit DP

3.54 Probability DP

3.55 State Machine DP

3.56 String Matching

3.57 Binary Indexed Tree / Segment Tree

3.58 Maths / Geometry

3.59 Line Sweep

3.60 Suffix Array

4. Low Level Design

4.1 Object Oriented Programming

4.2 Design Principles

4.3 UML

4.4 Design Patterns - Creational

4.5 Design Patterns - Structural

4.6 Design Patterns - Behavioral

4.7 LLD Interview Tips

4.8 LLD Interview Questions - Easy

4.9 LLD Interview Questions - Medium

4.10 LLD Interview Questions - Hard

Last Updated On May 1, 2025