What’s up fellow nerds
Hope you’re having a kick ass day. Here’s your interview problem and industry news for the day!
Daily Interview Problem
You are given n non-negative integers that represent a series of blocks. The integers represent the height of a block. The width of each block is 1. The blocks are placed one after another. If it rains over the blocks compute how much water the blocks will trap.
Example with input [0,1,0,2,1,0,1,3,2,1,2,1]
Input: [0,1,0,2,1,0,1,3,2,1,2,1] Output: 6
- Australian Media Companies are pissed at Google, and the Australian Government is stepping in - Australia released a landmark proposal, creating an arbitration system that will make binding decisions on fees that Google and Facebook must pay to media companies. Google has warned the Australian Government that the company takes a very small amount of economic value from news and that the company may withdraw it’s news services from Australia entirely. Read More
- Robinhood raises $200M - Robinhood raised a $200 million dollar series G (yeah…they’re on G now lol) funding round from a new investor, D1 Capital Partners. The round values the startup at $11.2 billion dollars, a significant jump from their last valuation of $8.6 billion dollars. This comes with chatter about a possible Robinhood IPO coming up. Read More
- Hour One raises a $5 million dollar seed round to generate AI-driven avatars - Hour One is working on building technology that allows you to take a person’s image and their voice and create an online avatar of them. This avatar can then serve as a customer representative or a salesperson on a website and dynamically talk to customers. Read More
Daily Interview Problem Solution
We’re going to be trying something new where we email you solutions the day after we send the problem. So we’ll send you the solution to today’s Daily Interview Problem tomorrow.
If you’re super keen on seeing the solution, just google the problem lol. You’ll find it on LeetCode.