This is absolutely amazing, the fact that you can click on text and it takes you immediately to the part of the audio where that text is being said is great.

I wish the video was shown as well, but other than that, excellent work!

Now you can also watch the video, and drag it anywhere you want.

Demo in my tweet https://twitter.com/ldenoue/status/1788231159140196804

The site embeds the YouTube video so we can hear the audio, so I could show the video as well, just not sure where :)

Perhaps split in 2 columns on wide displays (video left, transcript right), and portrait (e.g. mobile phone), video on top and transcript below it?

Thanks for recommending this, I just browsed some files online and it's looking indeed amazing.

P.S. It's now easy to check a repo file by replace .com with .dev: https://github.dev/desktop/desktop

You can also just click the . (period) key when viewing any repo.

Google Graveyard: https://killedbygoogle.com/

I believe they do help, but certainly hiring doesn't seem to be a priority for them at the moment.

It's strange that they decided to discontinue the entire competition instead of just cancelling this year's one, though.

They did, indeed, lay off the group in charge of organizing these competitions (or at least the Google Code Jam Program Manager).

https://twitter.com/jonathanirvings/status/16220755214872084...

The $5 wrench: https://xkcd.com/538/ You would still be vulnerable to a $10 wrench though, so don't use this.

Hey Tomas, I just send an email with my application, but I've got "Delivery Status Notification (Failure)". Is the email posted correct?

Location: Rosario, Argentina

Remote: Yes! (EST/PST timezones OK)

Willing to relocate: Yes

Technologies: Typescript, React/Svelte + Redux, Python, PHP, C++, interested in Rust, SQL.

Résumé/CV: overview at https://github.com/mredigonda

Email: maxiredigonda@gmail.com

I'm a Software Engineer from Argentina, strongly experienced in algorithms and data structures (from programming competitions like IOI and ICPC), and web development in general.

I'm open to chat in general about your company to see if there is a good match. In the worst case, having an extra connection is always beneficial for both.

You can also do x + (y - x) / 2 (starting point + distance halved), that doesn't overflow, is easy to remember, and the compiler would probably optimize it further.

And wrong, since x=-1 and y=INT_MAX overflows.

Other comments point out that can overflow for some values.

However if you're doing mid-point in something like binary search where you already know y >= x AND x >= 0, then x + (y - x) / 2 is indeed a fine choice. It's a good one to remember.

This can overflow for signed integers.

Indeed this overflows too! Still don't have the rights here to edit or delete the comment, sorry for the confusion! It needs a couple of extra conditions: x and y need to be uint, and y needs to be >= x (you can swap them if they are not).

It's not a special right, you just have to do it within 2 hours.

The subtraction could overflow.

Why this could be better than (x+y)/2, since they both overflows?

Because the division is truncated twice, which increases the error. Take x=y=1, or x=y=3 for example.