System Design Problems

-
Design uber, ola or lyft

Design whats app or chat system

Design twitter or a social network platform 

Design distributed cache system

Design rate limiting system
https://www.youtube.com/watch?v=mhUQe4BKZXs
https://www.youtube.com/watch?v=xrizarXJgC8&t=694s
https://www.youtube.com/watch?v=FU4WlwfS3G0
https://www.youtube.com/watch?v=nBdTBDJNOh8

 Design netflix
https://www.youtube.com/watch?v=psQzyFfsUGU&t=1745s
Other design problems 
https://www.youtube.com/watch?v=QmX2NPkJTKg - instagram
https://www.youtube.com/watch?v=gktZsX9Z8Kw - tic tac toe
https://www.youtube.com/watch?v=bBTPZ9NdSk8 - notification service
https://www.youtube.com/watch?v=iJLL-KPqBpM - distributed message queue 
https://www.youtube.com/watch?v=3zCK_5U69A8&t=6s - how distributed computing works
https://www.youtube.com/watch?v=dZ3swmtR1As - Real-time data processing
https://www.youtube.com/watch?v=LcuT0ynb_ks - Distributed file systems
https://www.youtube.com/watch?v=BFcNDPt6SlE - What is asynchronous processing?
https://www.youtube.com/watch?v=BKZxZwUgL3Y - web crawler system design
https://www.youtube.com/watch?v=dUMWMZmMsVE - Stock exchange design
https://www.youtube.com/watch?v=5-JYVeM3IQg - Bit map indexing
https://www.youtube.com/watch?v=8ZgRW0DNus4 - Efficient counting using bitmaps
https://www.youtube.com/watch?v=uMkVi4SDLbM - How row oriented and column oriented db works?
https://www.youtube.com/watch?v=zkACt4NYkU4 - In Memory databases internals for system design interviews
https://www.youtube.com/watch?v=rsx1nt2bxf8 - Data corruption and Merkle trees
https://www.youtube.com/watch?v=emLwVder3Yk - Infrastructure as code introduction
https://www.youtube.com/watch?v=_5vrfuwhvlQ - How databases scale writes: The power of the log
https://www.youtube.com/watch?v=0myM0k1mjZw - Capacity Estimation: How much data does YouTube store daily?
https://www.youtube.com/watch?v=eV1haPUt0NU - Hyperloglog: Facebook's algorithm to count distinct elements
https://www.youtube.com/watch?v=UmWtcgC96X8 - S3 system design
https://www.youtube.com/watch?v=josjRSBqEBI - Paste bin system design
https://www.youtube.com/watch?v=Myp8z0ybdzM - Cache Consistency: Memcached at Facebook

Comments

Post a Comment

Popular posts from this blog

Longest Subarray with Sum greater than Equal to K

-
Given an array of N integers. The task is to find the maximum length subarray such that the sum of all its elements is greater than or equal to K. Input: arr[]= {-1, 4, -2, -5, 6, -8}, K=0 Output: 5 Explanation: {-1, 4, -2, -5, 6} forms the longest sub array  with sum=2. Discussion : class Pair { private int sum ; private int index ; Pair ( int sum , int index ){ this . index = index ; this . sum = sum ; } public int getSum () { return sum ; } public int getIndex () { return index ; } } import java.util.* ; public class test { static int findInd ( ArrayList < Pair > preSum , int n , int val ) { int l = 0 , h = n - 1 , mid ; int ans = - 1 ; while ( l <= h ) { mid = l + ( h - l )/ 2 ; if ( preSum . get ( mid ). getSum () <= val ) { ans = mid ; ...
Read more

Search in Rotated Sorted Array

-
Suppose a sorted array is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2). You are given a target value X to search. If X found in the array return its index, otherwise return -1 Discussion :  Case 1 : No duplicate exists in the array public int search ( int [] nums , int x ) { int left = 0 ; int right = nums . length - 1 ; while ( left <= right ){ int mid = left + ( right - left )/ 2 ; if ( x == nums [ mid ]) return mid ; if ( nums [ left ]<= nums [ mid ]){ if ( nums [ left ]<= x && x < nums [ mid ]){ right = mid - 1 ; } else { left = mid + 1 ; } } else { if ( nums [ mid ]< x && x <= nums [ right ]){ left = mid + 1 ; } else { right = mid - 1 ; } } } retu...
Read more

Consistent Hashing

-
Consistent Hashing is a distributed hashing scheme that operates independently of the number of servers or objects in a distributed  hash table  by assigning them a position on an abstract circle, or  hash ring . This allows servers and objects to scale without affecting the overall system. In other words,  It facilitates the distribution of data across a set of nodes in such a way that minimizes the re-mapping/ reorganization of data when nodes are added or removed. BENEFITS OF CONSISTENT HASHING: Enables Elastic Scaling of cluster of database/cache servers Facilitates Replication and partitioning of data across servers Partitioning of data enables uniform distribution which relieves hot spots Must Read Places: https://www.toptal.com/big-data/consistent-hashing https://towardsdatascience.com/consistent-hashing-simplified-7fe4e512324 https://www.acodersjourney.com/system-design-interview-consistent-hashing/ https://www.youtube.com/watch?v=zaRkO...
Read more