Christmas Tree

Content This password is for my bank So the password should be as secure as possible 0 Longer passwords are generally more secure ThisPasswordHas21Char Yup Yup Makes sense to me Error: Password should have between 8 and 20 characters

Content SOFTWARE ENGINEER CHEAT SHEET Source:TheCooperReview.com It's a non-trivial amount of work I won't be able to copy and paste This is a temporary This is a permanent solution solution lIl be finished by Monday That's funny Do you want it done fast or do you want it done right? Just file a bug I won't tell you which Monday I literally hate you It will be neither I have no idea what you're saying right now That's an expansion forgot you needed that feature of scope We can't test that We can but we won't I'll just put it behind a flag for now It will never ship I can't realistically estimate that - I don't know how estimates work I don't think users will care about that have dinner reservations at 8 This is an Alpha release It doesn't work This is a Beta release We fixed a lot of bugs but it still doesn't work I'll add that to the I'm hoping you'll forget about it backlog We are focusing on - I'm going to go take a nap high priority fixes only

Content Pranay Pathole PPathole Find bug, write fix Click 'run', bug is still there Pull hair out over why obvious solution isn't working Question career choices Realise you didn't hit 'build and run'

Content Senior engineer enjoying his retirement while production crashed after he quit and now the company is about to go bankrupt

Content BUG FEATURE

Content Bae: Come over Dijkstra: But there are so many routes to take and I don't know which one's the fastest Bae: My parents aren't home Dijkstra: Dijkstra's algorithm Graph search algorithm Not to be confused with Dykstra's projection algorithm. Dijkstra's algorithm is an algorithm for finding the shortest paths between nodes in a graph, which may represent, for example, road networks. It was conceived by computer scientist Edger W. Dijkstra in 1956 and published three years later. (12) The algorithm exists in many variants; Dijkstra's original variant found the shortest path between two nodes, but a more common variant fixes a single node as the "source node and finds shortest paths from the source to all other nodes in the graph, producing a shortest-path tree. Dijkstra's algorithm Out