The Hello World GitHub Portfolio Strategy

Content Bae: Come over Dijkstra: But there are so many routes to take and I don't know which one's the fastest Bae: My parents aren't home Dijkstra: Dijkstra's algorithm Graph search algorithm Not to be confused with Dykstra's projection algorithm. Dijkstra's algorithm is an algorithm for finding the shortest paths between nodes in a graph, which may represent, for example, road networks. It was conceived by computer scientist Edger W. Dijkstra in 1956 and published three years later. (12) The algorithm exists in many variants; Dijkstra's original variant found the shortest path between two nodes, but a more common variant fixes a single node as the "source node and finds shortest paths from the source to all other nodes in the graph, producing a shortest-path tree. Dijkstra's algorithm Out

Content "Programming is not stressful at all" Dave - 26 years old

Content The entire world financial system COBOL

Content Me coming home to my crystals after a long day of programming, hoping they will somehow protect me from all of the other people's code I've seen

Content Artak Kalantarian 3rd Founder at peaceofmind.ai - UC Berkeley SkyDeck Pad-13... 5d Edited g At one of my first interviews I was asked to reverse a singly linked list. The conversation went this way: Interviewer: "How would you reverse a singly linked list" Me: "Would stick the items into a stack, and pop them out and link them again" Interviewer: "But the linked list can be infinite" Me: "Would stick the items into an infinite stack" Interviewer: "Where would you find the infinite stack?" Me: "Exactlv at the same place where vou found the infinite linked list" I can never resist a good joke. In this case it went well. 08 602 18 comments

Content 2023! Happy 1672614000 seconds since 111970!