If you are thinking of taking a screenshot of your IDE's build output, cropping it badly, so the whole error is not included and posting that as a description of the bug, stop. Instead, back away from the computer and rethink your life.

Exactly!

Backtracking is an algorithm for finding all (or some) of the solutions to a problem that incrementally builds candidates to the solution(s). As soon as it determines that a candidate cannot possibly lead to a valid solution, it abandons the candidate. Backtracking is all about choices and consequences.

In this article I’m trying to explain the difference/similarities between dynamic programing and divide and conquer approaches based on two examples: binary search and minimum edit distance (Levenshtein distance).

Here's a recap of how you should be spending your day at work:

9:00AM-3:30PM: Start by reading your checkpoint notes from the day before so you can get started immediately, then work normally.

3:30PM-4:45PM: Continue on existing task, if you’re finished then transition to small tasks and planning.

4:45PM-5:00PM: Checkpoint your work, then leave your office.

5:00PM-…: Whatever you want to do.

Richard Feynman <3

very nice! especially this one:
Investing hack: Give compounding the decades it requires.

Très belles photos d’architecture d’intérieur

bonne explication à propos des emails

So to avoid all of this, I’m just going to say that no, time doesn’t exist, therefor writing code for it doesn’t matter, so boom, we’re done here! Thanks for reading.

To read

great article on what's expected as the output of a UNIX tool.

This is a web book, designed to be read on the web (with or without an internet connection).

UCT = Upper Confidence bounds applied to Trees
(think HackerNews algorithm)

TL;DR add a bonus to newer content based on uncertainty