Free interview question for candidates where you want to test some basic knowledge of graph and probability theory:
You are in a city with square blocks, sidewalks on both sides of every street, evenly timed street lights at every intersection, and jaywalking is punishable by death. What is the optimal strategy for traversing from point (0,0) on the grid to point (k,j)? Can you prove it is optimal?
Daniel Spiewak /
npub1nf…stprm
2024-02-14 03:31:34
Author Public Key
npub1nfjd63p9den5retrjz3yeye3rvhcle5amqfhnvvttraelmpsf2ps2stprmPublished at
2024-02-14 03:31:34Event JSON
{
"id": "b0a30e6b1f10d7fb34fce5d2ff40fb09f53052567f50c65ffddc2c164cdc8e7f",
"pubkey": "9a64dd44256e6741e56390a24c93311b2f8fe69dd81379b18b58fb9fec304a83",
"created_at": 1707881494,
"kind": 1,
"tags": [
[
"proxy",
"https://fosstodon.org/users/djspiewak/statuses/111927721617165771",
"activitypub"
]
],
"content": "Free interview question for candidates where you want to test some basic knowledge of graph and probability theory:\n\nYou are in a city with square blocks, sidewalks on both sides of every street, evenly timed street lights at every intersection, and jaywalking is punishable by death. What is the optimal strategy for traversing from point (0,0) on the grid to point (k,j)? Can you prove it is optimal?",
"sig": "50b75dc218f1bb913a05621743d1192891fcd6da3c744b04f7729aa988cd3be079ab7a62d6da46a7d806df86707f11871a94ee635f0832bc382ac0a66b087838"
}