Author name: Admin

⏱ 6 min read You have an array of n+1 integers where each integer is in the range [1, n]. By the pigeonhole principle, […] Read article

⏱ 6 min read “How many piano tuners are there in Chicago?” This is the original Fermi problem, from which the entire genre of Read article

⏱ 6 min read “How many golf balls would fit inside a school bus?” was the most-cited Google brainteaser of the 2000s and the Read article

⏱ 6 min read Google‘s hiring rubric in 2026 evaluates four dimensions: General Cognitive Ability (GCA), Role-Related Knowledge (RRK), Leadership, and Googleyness. The four-dimension Read article

⏱ 6 min read Numbers arrive one at a time in a stream. After each number, return the median of all numbers seen so Read article

⏱ 7 min read “If you were an animal, what would you be and why?” “If you were a tree, what tree?” “What superpower Read article

⏱ 7 min read You walk into the interview. The interviewer does not introduce themselves. They open with “Why are you wasting my time Read article

⏱ 7 min read The famous interview questions of the last 30 years sort cleanly into three buckets in 2026: alive and asked daily, Read article

⏱ 6 min read You are presented with two indistinguishable envelopes. You are told that one contains twice as much money as the other. Read article

⏱ 6 min read Implement atoi: a function that converts a string to a signed 32-bit integer. This is LeetCode 8, and it is Read article

⏱ 6 min read In late 2024, a senior frontend engineer who had interviewed at Lyft posted a Twitter thread describing his loop. He Read article

⏱ 6 min read You are interviewing candidates for a job. There are n candidates total. You interview them one at a time, in Read article

⏱ 5 min read Given an array of non-negative integers where each element represents the height of a vertical line on the x-axis, find Read article

⏱ 5 min read “Sell me this pen.” Jordan Belfort holds it out at the end of The Wolf of Wall Street (2013), and Read article

⏱ 6 min read Given a string, find the length of the longest substring without repeating characters. This is LeetCode 3, and it is Read article