Zero to One by Peter Thiel: Key Ideas and Notes
Key ideas from Peter Thiel's Zero to One: the last-mover advantage, the contrarian interview question, why monopolies beat competition, and starting small.
Key ideas from Peter Thiel's Zero to One: the last-mover advantage, the contrarian interview question, why monopolies beat competition, and starting small.
How depth-first search (DFS) explores a graph branch by branch, tracks visited nodes, and backtracks, with a recursive implementation in Python.
Detect a cycle in a linked list with Floyd's tortoise and hare algorithm: slow and fast pointers, step-by-step logic, code, and O(n) time, O(1) space.
Learn structs in Go: how to define them, create instances, access fields, and use nested and anonymous structs to model your own data types.
Learn pointers in Go: declare, initialize, and dereference them, change values through functions, and see common use cases with code examples.
Go string snippets with code: capitalize the first letter of a string, check whether a string is a palindrome, and reverse a string.
Build a simple HTTP server in Go: create a module, write a handler with net/http, and return Hello, World! on port 8080 in a few lines of code.
Apache Kafka is a distributed event streaming platform. Learn how topics, partitions, offsets, and consumer groups work, and when to use Kafka.
JavaScript interview problem: return N objects that share one prototype, with a value() method that is not an own property. Solution with full code.
JavaScript interview problem: fetch a list of URLs with a concurrency limit, keep responses in order, and avoid repeat requests. Solution with code.