Shanghai -> Pittsburgh -> Bay Area
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/xthumb3.jpg.pagespeed.ic.hroG9UCO_i.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 …