Shanghai -> Pittsburgh -> Bay Area
Given a binary tree, you need to compute the length of the diameter of the tree. The diameter of a binary tree is the length of the longest path between any two nodes in a tree. This path may or may not pass through the …
![[StorageSystem] SSD](http://52.205.168.20/wp-content/themes/kale/sample/images/thumb3.jpg)
Write Amplification in SSD We need to have a map betwwen LBA to PBA, logical block address to physical block address. In DRAM, overwrite/ update would be relatively easy, find the address, and then replace the old value with the new value directly. But it …
Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n). Example: Input: S = “ADOBECODEBANC”, T = “ABC” Output: “BANC” Note: If there is no such window in S that …
![[DatabaseSystem] Database Storage 1](http://52.205.168.20/wp-content/themes/kale/sample/images/thumb1.jpg)
Today we would focus on how data organized in disk. DBMS would assume that the primary storage is lied on the non-volatile storage. Storage Hierarchy Overview Typical Storage Layer: cpu register cpu cache DRAM (Non-volitile memory) SSD HDD Network Storage Usually data is moved from …
题目大意 Given n nodes labeled from 0 to n-1 and a list of undirected edges (each edge is a pair of nodes), write a function to check whether these edges make up a valid tree. Example 1: Input: n = 5, and edges = [[0,1], …
![[Storage System] High Level Overview and Perofrmance Metrics](https://i0.wp.com/52.205.168.20/wp-content/uploads/2018/09/ss1-1.png?resize=470%2C348)
![[DatabaseSystem] Advanced SQL](https://i0.wp.com/52.205.168.20/wp-content/uploads/2018/09/db1.png?resize=760%2C400)