Some of these computers are web servers, which are just specialized computers that contain and serve content from your favorite websites, and others are just the client devices.
A columnar database stores the data of an entire column in consecutive memory blocks, while a relational database stores the data of an entire row of a table in consecutive memory blocks.
When a query is run against a column on which a secondary index is created, the database will go to the secondary index (where it is stored) and look for the address of the corresponding row in the table.
Sharding is horizontal (row wise) database partitioning as opposed to vertical (column wise) partitioning which is Normalization.
You’ve N elements and you need to find the subsets of these N elements where zero or more of the N elements are included or excluded.
Given the head pointer of a linked list, check if there’s a loop in the linked list. Return true if there’s a loop.
Floyd’s Cycle-Finding Algorithm (Proof)
These are the articles, dedicated specifically to advanced competitive programming concepts.
Modular Multiplicative Inverse, Nth Catalan Number.
This is similar to linear regression but instead of having single dependent variable Y, we have multiple output variables. It may be written as,Y = XB + U ,where Y is a matrix with series of multivariate measurements (each column being a set of measurements on one of the dependent variables), […]
Given two strings s and t, return true if t is an anagram of s, and false otherwise. An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase
Consider the 2D grid formed by integer points on the XY Plane. The position of the Sniper and the Target are lattice points in this grid. The bullet shot by the Sniper will follow a straight line trajectory from (x1, y1) to (x2, y2). The bullet goes no further than (x2, y2).