neetcode

1. 01computer architecture
2. 02application architecture
3. 03design requirements
4. 04networking basics
5. 05tcp and udp
6. 06dns
7. 07http
8. 08websockets
9. 09api paradigms
10. 10api design
11. 11caching
12. 12cdns
13. 13proxies and load balancing
14. 14consistent hashing
15. 15sql
16. 16nosql
17. 17replication and sharding
18. 18cap theorem
19. 19object storage
20. 20message queues

arpit (b)

1. 01course introduction
2. 02what is system design
3. 03how to approach system design
4. 04how do you evaluate that you have built a good system
5. 05relational databases
6. 06database isolation levels
7. 07scaling databases
8. 08sharding and partitioning
9. 09non-relational databases
10. 10picking the right database
11. 11what is caching
12. 12populating and scaling a cache
13. 13caching at different levels
14. 14message brokers and queues
15. 15message stream and kafka essentials
16. 16realtime pubsub
17. 17load balancers
18. 18circuit balancers
19. 19data redundancy and recovery
20. 20leader election for auto-recovery
21. 21client server model and communication protocols
22. 22blob storage and s3
23. 23bloom filters
24. 24consistent hashing
25. 25introduction to big data tools
26. 26design ecommerce product listing
27. 27designing api rate limiter
28. 28designing and scaling notifications
29. 29designing realtime abuse master
30. 30designing tinder feed
31. 31designing twitter trends
32. 32designing url shortener
33. 33designing github gists and pastebin
34. 34designing a fraud detection system
35. 35designing a recommendation engine
36. 36designing a web crawler

arpit (a)

1. 01foundational topics in system design - i
2. 02foundational topics in system design - ii
3. 03relational databases
4. 04non-relational databases
5. 05distributed systems
6. 06distributed id generators
7. 07building social network - i
8. 08building social network - ii
9. 09storage engines - i
10. 10storage engines - ii
11. 11high throughput systems - i
12. 12high throughput systems - ii
13. 13information retrieval systems
14. 14adhoc system design
15. 15algorithmic system design - i
16. 16algorithmic system design - ii

data structures

arrays

• 1.ram
• 2.static arrays
• 3.dynamic arrays
• 4.stacks
• 5.kadanes algo (a)
• 6.sliding window fixed (a)
• 7.sliding window variable (a)
• 8.two pointers (a)
• 9.prefix sums (a)

linked lists

• 1.singly linked lists
• 2.doubly linked lists
• 3.queues
• 4.fast and slow pointers (a)

recursion

• 1.factorial
• 2.fibonacci

sorting

• 1.insertion sort
• 2.merge sort
• 3.quick sort
• 4.bucket sort

binary search

• 1.search array
• 2.search range

trees

• 1.binary search trees
• 2.bst insert and remove
• 3.depth first search
• 4.breadth first search
• 5.bst sets and maps

backtracking

• 1.tree maze
• 2.subsets (a)
• 3.combinations (a)
• 4.permutation (a)

heap priority queue

• 1.heap properties
• 2.push and pop
• 3.heapify

hashing

• 1.hash usage
• 2.hash implementation

graphs

• 1.intro to graphs
• 2.matrix dfs
• 3.matrix bfs
• 4.adjacency list
• 5.dijkstra (a)
• 6.prims (a)
• 7.kruskals (a)
• 8.topological sort (a)

dp

• 1.dimension dp 1
• 2.dimension dp 2
• 3.knapsack (a)
• 4.unbounded knapsack
• 5.lcs
• 6.palindromes

bit manipulation

• 1.bit operator

tries

• 1.trie (a)
• 2.union find (a)
• 3.segment trees (a)
• 4.iterative dfs (a)

heaps

• 1.heaps (a)