This is kind of an addition to earlier “System design notes” medium post and I am creating a new post here , just dedicated to “how and why we choose any database/component for a system design purpose?”. I will try to add all my notes on why choice1 over choice2…

Below are my collection of resources to learn about system design/operating systems related concepts. As I continue on my journey of learning new things, I will keep on adding to this list ! :) Happy Learning !! p.s. I have created a new post dedicated to “Databases related notes w.r.t…

GitHub - valaks-tech/TransactionalKeyValueStore: How to Design a Transactional Key-value Store in… You can't perform that action at this time. You signed in with another tab or window. You signed out in another tab or…github.com

Given a string containing nested brackets, print all the “strings” in the highest/innermost bracket level. You can assume that brackets are all valid and ignore any whitespaces. — input = ( p((qsdgfsgsgd(dfggfg))) ((s(ssdgssgf))t) )” output = [[‘dfggfg’], [‘ssdgssgf’]] (as both are at maximum 4th nested level)

Given a collection of intervals, return a maximal set of non-overlapping intervals while prioritizing the longer intervals. — input — (1,5),(2,7),(11,18) output — (11, 18), (2, 7) In the given example, (1,5) and (2,7) are overlapping intervals and while choosing between the two, (2,7) is chosen as 7–2 > 5–1. Time complexity: O(N logN) Space Complexity: O(N)

Problem Statement: Given a huge number of hosts in multiple regions, how will you deploy code and handle error detection, high availability etc. ? Before we dive down how can we deploy in multiple regions, lets try to understand how and what strategies need to be taken into consideration when…

Design a search autocomplete system for a search engine. Users may input a sentence (at least one word and end with a special character '#'). You are given a string array sentences and an integer array times both of length n where sentences[i] is a previously typed sentence and times[i]…

Given a grid G of numbers representing heights of persons standing next to each other. A person can see another person in the grid if the height of everyone in between is shorter than them A person can see to the right and down Return a grid A where A[x][y] is the sum of all the persons seen from G[x][y] Example [9, 6, 8, 5, 11] [1, 5, 3, 7, 9] [2, 1, 4, 6, 1] Output [5, 3, 4, 2, 1] [4, 4, 3, 2, 1] [3, 2, 1, 1, 0]

System calls provide transition from ‘user space’ to ‘kernel space’; These are not just a routine calls. In newer systems, kernel code for system calls do exist inside the address space of the process itself ( top of the address space stack). process cant access them in general, but only…