-
8 Patterns Review For Successful Coding Interview
8 Patterns Review For Successful Coding Interview This is nothing but quick 5 min revision before going to interview. Visit https: https://codeandalgo.com for more such contents
-
Spotify System Design interview
Spotify System Design Interview Functional Requirement Reduced scope Non Functional Requirement Metrics Database Design We need to maintain below types of data tables i.e User, Artist Song’s metadata and actual song data. Below 3 parameters decides which db to be used. Here, metadata can be modified, queried frequently, so SQL db makes sense. Raw data…
-
What is difference between Authentication & Authorisation ?
What is difference between Authentication & Authorisation ? Let’s look at the exact difference. Authentication Authentication Types 1.Something you know 2.Something you have 3.Something you are Autherisation Please visit https: https://codeandalgo.com for more such contents.
-
Amazon Timestream
What is Amazon Timestream database? Amazon Timestream offers fully managed (serverless), purpose-built time-series database engines for workloads from low-latency queries to large-scale data ingestion. Optimised for
-
Change Data Capture (CDC)
Problem Statement Change Data Capture Imagine you’re designing the architecture of Instagram. When users visit a profile, they need to instantly see who this person follows. Approach & potential issues This requires querying a database table containing follower-followed relationships. To make this lookup fast, we need an index on the follower column. But here’s the…
-
CAP Theorem
Introduction CAP Theorem In database theory, the CAP theorem, also named Brewer’s theorem after computer scientist Eric Brewer, states that any distributed data store can provide only two of the following three guarantees. Consistency Availability Partition Tolerance What to do when network partition failure occurs ? When a network partition failure happens, it must be decided to do one of the following. Option A…
-
Min Stack
Leetcode#155 Min Stack Problem Statement Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. Implement the MinStack class: You must implement a solution with O(1) time complexity for each function. Example 1: Constraints: Logic / Trick Two Stack Since we want to achieve time complexity of O(1) for all operations, we can…