You know threads right ? No? Deadlocks?
Joined August 2023
- Tweets15
- Following5
- Followers5
- Likes0
When you press play on Netflix, the video doesn't stream from Amazon's cloud. It usually comes from a Netflix server in, or right next to, your internet provider, copied there overnight. The encoding, the night fill and steering, animated.
Twelve gold coins, and one of them is fake. The king thinks you made it.
Find it in three weighings and say whether it's heavier or lighter, or drink a thousand bottles of wine. Yes or no? 👇
Binary search and 1,500+ more problems are in Algo Mind. Link in bio.
Discord stores trillions of messages. Yet one channel with a single message took 20 seconds to load.
Tombstones, hot partitions, a Rust service and ScyllaDB: how 177 machines became 72 and slow reads got up to 8× faster.
Nobody has cracked this CIA code in over 35 years. Four messages, three solved, the fourth is 97 letters. The artist sold the answer. How much do you think it went for?
Your brother's kidneys are failing, and yours isn't a match.
A computer finds a stranger stuck the same way, and you swap. How far can one kidney go? Guess before the end.
Would you still go through with it?
A stranger at a party bets you a drink that two of the 23 people there share a birthday. 🎂
There are 365 days in a year. Would you take the bet?
Contains Duplicate and 1,500+ more problems are in Algo Mind. Link in bio.
A king wants a champagne tower. The cupbearer may only pour into the top glass, and loses his head if any glass isn't full at midnight. The cellar holds 1,000 bottles. How many rows can the tower have? 🥂
LeetCode 799. Animated, step by step: Algo Mind, link in bio.
Tesla's Roadster Hung Upside Down and Let Go: How Does a Computer Land It? (Feedback Loops Explained)
A king has 1,000 bottles of wine. One is poisoned: a single sip makes you sick exactly one day later, and the party is tomorrow. How many tasters does he need to find it?
The approach:
1. Initialize hash map — Create an empty hash map to store each number and its index as we iterate through the array.
2. Compute complement — For each number, calculate complement = target − num. This is the value we need to find.
3. Check hash map for complement — If the complement exists in the hash map, we found our pair. Return both indices.
4. Store current number — If the complement is not found, store the current number and its index in the hash map and continue.
#algorithms #datastructures