Desing a scalable distributed database system.
Tushar Roy- Coding Made Simple
active · last success 2026-08-06 19:34
-
-
https://www.facebook.com/tusharroy25/ This video describes how to prepare for system design interview. Below is all the content described in the video. A - Ask good questions B - Don't use buzzwords C - Clear and organized thinking D - Drive discussions with 80-20 rule Things...
https://www.facebook.com/tusharroy25/ This video describes how to prepare for system design interview. Below is all the content described in the video. A - Ask good questions B - Don't use buzzwords C - Clear and organized thinking D - Drive discussions with 80-20 rule Things to consider Features API Availability Latency Scalability Durability Class Diagram Security and Privacy Cost-effective Concepts to know Vertical vs horizontal scaling CAP theorem ACID vs BASE Partitioning/Sharding Consistent Hashing Optimistic vs pessimistic locking Strong vs eventual consistency RelationalDB vs NoSQL Types of NoSQL Key value Wide column Document-based Graph-based Caching Data center/racks/hosts CPU/memory/Hard drives/Network bandwidth Random vs sequential read/writes to disk HTTP vs http2 vs WebSocket TCP/IP model ipv4 vs ipv6 TCP vs UDP DNS lookup Http & TLS Public key infrastructure and certificate authority(CA) Symmetric vs asymmetric encryption Load Balancer CDNs & Edges Bloom filters and Count-Min sketch Paxos Leader election Design patterns and Object-oriented design Virtual machines and containers Pub-sub architecture MapReduce Multithreading, locks, synchronization, CAS(compare and set) Tools Cassandra MongoDB/Couchbase Mysql Memcached Redis Zookeeper Kafka NGINX HAProxy Solr, Elastic search Amazon S3 Docker, Kubernetes, Mesos Hadoop/Spark and HDFS References https://docs.datastax.com/en/cassandra/2.1/cassandra/architecture/architectureIntro_c.html http://cloudurable.com/blog/kafka-architecture/index.html https://zookeeper.apache.org/doc/trunk/zookeeperOver.html http://www.allthingsdistributed.com/files/amazon-dynamo-sosp2007.pdf https://research.google.com/archive/bigtable.html https://en.wikipedia.org/wiki/CAP_theorem https://en.wikipedia.org/wiki/Consistent_hashing https://www.mongodb.com/mongodb-architecture https://en.wikipedia.org/wiki/HTTP/2 https://en.wikipedia.org/wiki/Transport_Layer_Security -
System design : Design messaging or chat service like facebook messenger. https://redis.io/topics/cluster-tutorial https://docs.datastax.com/en/cassandra/2.1/cassandra/architecture/architectureIntro_c.html https://en.wikipedia.org/wiki/WebSocket
System design : Design messaging or chat service like facebook messenger. https://redis.io/topics/cluster-tutorial https://docs.datastax.com/en/cassandra/2.1/cassandra/architecture/architectureIntro_c.html https://en.wikipedia.org/wiki/WebSocket -
In example 1 end should be 5(not 4) since there are total 5 elements. Find median of two sorted arrays of different sizes. Algorithm is based on binary search....
In example 1 end should be 5(not 4) since there are total 5 elements. Find median of two sorted arrays of different sizes. Algorithm is based on binary search. https://github.com/mission-peace/interview/blob/master/src/com/interview/binarysearch/MedianOfTwoSortedArrayOfDifferentLength.java https://www.facebook.com/tusharroy25/ -
System design: How to design an autocomplete feature for search engine like Google or Bing. Design should be scalable/available/durable. https://www.facebook.com/tusharroy25/
System design: How to design an autocomplete feature for search engine like Google or Bing. Design should be scalable/available/durable. https://www.facebook.com/tusharroy25/ -
the convex hull or convex envelope of a set X of points in the Euclidean plane or in a Euclidean space (or, more generally, in an affine space over the reals) is the smallest convex set that contains X. For instance, when X is a bounded subset of the plane, the convex hull...
the convex hull or convex envelope of a set X of points in the Euclidean plane or in a Euclidean space (or, more generally, in an affine space over the reals) is the smallest convex set that contains X. For instance, when X is a bounded subset of the plane, the convex hull may be visualized as the shape enclosed by a rubber band stretched around X. https://github.com/mission-peace/interview/blob/master/src/com/interview/geometry/JarvisMarchConvexHull.java https://leetcode.com/problems/erect-the-fence/ -
System design: Design a scalable service which supports tiny url use case.
-
No full content extracted yet.
Extracting… -
https://www.facebook.com/tusharroy25 https://leetcode.com/problems/burst-balloons/ https://github.com/mission-peace/interview/blob/master/src/com/interview/dynamic/BurstBalloons.java https://github.com/mission-peace/interview/wiki
https://www.facebook.com/tusharroy25 https://leetcode.com/problems/burst-balloons/ https://github.com/mission-peace/interview/blob/master/src/com/interview/dynamic/BurstBalloons.java https://github.com/mission-peace/interview/wiki -
https://www.facebook.com/tusharroy25 https://github.com/mission-peace/interview/blob/master/src/com/interview/dynamic/Immutable2DSumRangeQuery.java https://github.com/mission-peace/interview/wiki Given a 2D matrix matrix, find the sum of the elements inside the rectangle...
https://www.facebook.com/tusharroy25 https://github.com/mission-peace/interview/blob/master/src/com/interview/dynamic/Immutable2DSumRangeQuery.java https://github.com/mission-peace/interview/wiki Given a 2D matrix matrix, find the sum of the elements inside the rectangle defined by its upper left corner (row1, col1) and lower right corner (row2, col2). -
https://www.facebook.com/tusharroy25 https://github.com/mission-peace/interview/blob/master/src/com/interview/dynamic/RegexMatching.java https://github.com/mission-peace/interview/wiki Given a regex which supports '*' and '.' . Do regex matching.
https://www.facebook.com/tusharroy25 https://github.com/mission-peace/interview/blob/master/src/com/interview/dynamic/RegexMatching.java https://github.com/mission-peace/interview/wiki Given a regex which supports '*' and '.' . Do regex matching. -
https://www.facebook.com/tusharroy25 https://github.com/mission-peace/interview/wiki https://github.com/mission-peace/interview/blob/master/src/com/interview/tree/LowestCommonAncestoryBinarySearchTree.java Find lowest common ancestor in binary search tree.
https://www.facebook.com/tusharroy25 https://github.com/mission-peace/interview/wiki https://github.com/mission-peace/interview/blob/master/src/com/interview/tree/LowestCommonAncestoryBinarySearchTree.java Find lowest common ancestor in binary search tree. -
https://www.facebook.com/tusharroy25 https://github.com/mission-peace/interview/blob/master/src/com/interview/misc/SparseTableRangeMinimumQuery.java https://github.com/mission-peace/interview/wiki In computer science, a range minimum query (RMQ) solves the problem of finding...
https://www.facebook.com/tusharroy25 https://github.com/mission-peace/interview/blob/master/src/com/interview/misc/SparseTableRangeMinimumQuery.java https://github.com/mission-peace/interview/wiki In computer science, a range minimum query (RMQ) solves the problem of finding the minimal value in a sub-array of an array of comparable objects. Range minimum queries have several use cases in computer science such as the lowest common ancestor problem or the longest common prefix problem (LCP). -
https://www.facebook.com/tusharroy25/ https://github.com/mission-peace/interview/wiki https://github.com/mission-peace/interview/blob/master/src/com/interview/tree/LowestCommonAncestorInBinaryTree.java Given two nodes find lowest common ancestor of these 2 nodes in the binary tree
https://www.facebook.com/tusharroy25/ https://github.com/mission-peace/interview/wiki https://github.com/mission-peace/interview/blob/master/src/com/interview/tree/LowestCommonAncestorInBinaryTree.java Given two nodes find lowest common ancestor of these 2 nodes in the binary tree -
https://www.facebook.com/tusharroy25 https://github.com/mission-peace/interview/blob/master/src/com/interview/tree/TreeTraversals.java#L98 https://github.com/mission-peace/interview/wiki Postorder traversal of binary tree using one stack.
https://www.facebook.com/tusharroy25 https://github.com/mission-peace/interview/blob/master/src/com/interview/tree/TreeTraversals.java#L98 https://github.com/mission-peace/interview/wiki Postorder traversal of binary tree using one stack. - End of feed
