My version in python. The code is specific to how g, the graph matrix is defined. Here is a good explanation to why we need to get the vertex with min edge in each iteration. [code] def graphDistances(g, s): INFINITY = 9999999999 size = len(g) dist = [INFINITY] * size prev = [None] * size unvisited = set(range(size)) dist[s] = 0 while unvisited: u = findVertexWithMinDist(unvisited, dist) unvisited.remove(u) for v, edge_weight in enumerate(g[u]): if edge_weight == -1: continue my_dist = dist[u] + edge_weight if my_dist < dist[v]: dist[v] = my_dist prev[v] = u ...

https://www.ted.com/talks/james_bridle_the_nightmare_videos_of_childrens_youtube_and_what_s_wrong_with_the_internet_today?utm_source=newsletter_daily&utm_campaign=daily&utm_medium=email&utm_content=image__2018-06-22

A nice 99-page doc for anyone out there who may want to be a CEO someday. https://docs.google.com/document/d/1ZJZbv4J6FZ8Dnb0JuMhJxTnwl-dwqx5xl0s65DE3wO8/preview#

[code] # Python program to do inorder traversal without recursion and # without stack Morris inOrder Traversal # A binary tree node class Node: Constructor to create a new node def __init__(self, data): self.data = data self.left = None self.right = None # Iterative function for inorder tree traversal def MorrisTraversal(root): ...

https://www.interviewcake.com/data-structures-reference

Given an array of integers, find the maximum possible sum you can get from one of its contiguous subarrays. The subarray from which this sum comes must contain at least 1 element. For inputArray = [-2, 2, 5, -11, 6], the output should be arrayMaxConsecutiveSum2(inputArray) = 7. The contiguous subarray that gives the maximum possible sum is [2, 5], with a sum of 7. Guaranteed constraints: 3 ≤ inputArray.length ≤ 105, -1000 ≤ inputArray[i] ≤ 1000. ...

https://en.wikipedia.org/wiki/List_of_unicorn_startup_companies I wasn’t aware of that many unicorn startups from china. Turns out there are quite a lot.

Very often in old databases a timestamp column does not have the timezone info. This becomes an issue when the business gets bigger and crosses different timezones. [code] select bare_timestamp_field at time zone ‘Asia/Shanghai’ at time zone ‘US/Pacific’ from some_table; [/code] The above sample query assigns the Shanghai timezone to the bare timestamp, then convert the resulting timestamp w/ timezone to the US Pacific PST timestamp. The double ‘at time zone’ parts can be read as: from timezone #1 to timezone #2. This is due to the implicit syntax. A more explicit syntax is the following, which makes more sense similar to type casting. ...

Nice course with short videos that explains the history of our universe through many fields of study. https://www.bighistoryproject.com/home