https://www.seattletimes.com/seattle-news/we-were-all-screaming-oh-my-god%e2%80%8a-how-the-horizon-air-theft-and-crash-unfolded/ [soundcloud url=“https://api.soundcloud.com/tracks/484218441" params=“color=ff5500” width=“100%” height=“166” iframe=“true” /]

Engineering whiteboard interviews: yay or nay? https://www.keyvalues.com/blog/engineering-whiteboard-interviews-yay-or-nay Bad at whiteboard puzzles? You can still get a programming job https://codewithoutrules.com/2018/07/29/getting-a-job-without-whiteboard-puzzles/ A list of 500+ companies that don’t do whiteboard puzzles https://airtable.com/shr5TdnpVYVTpeRrN/tbluCbToxQ2knSLhh

https://www.fema.gov/media-library-data/1510153676317-82124ab3b0a31ea239f60acc8d46c2ba/FEMA_B-526_Earthquake_Safety_Checklist_110217_508.pdf

Is organic food really better? No pesticide used on organic food? You sure? Knowing that you are paying your premium for that, we should find out exactly how much organic food is better than conventional food. Modern Propaganda https://www.forbes.com/sites/stevensavage/2016/03/19/why-i-dont-buy-organic-and-why-you-might-want-to-either/#4188a10c69c3

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