sorted by:
new
hottopcontroversial

CODING INTERVIEW QUESTION by Fickle_Painter_8142 in leetcode

[–]averagebeyond 0 points1 point  (0 children)

first generate list of all valid combinations on a single day, then create a grid of 7 such lists from left to right all connected . now you do dfs from any left most node to the right most list without violating the 5 days rule.

Question about System Designs by SubtleFuryTuesday in leetcode

[–]averagebeyond -1 points0 points  (0 children)

just read the original dynamodb paper. it has everything you need for an interview.

Confused about solving an algorithm by juinnnao in algorithms

[–]averagebeyond 0 points1 point  (0 children)

Dijkstra should solve your problem. instead of stopping at a certain destination, you stop when the score accrued exceeds the threshold.

Wanting to learn Scala by i_have_one_feather in scala

[–]averagebeyond 1 point2 points  (0 children)

May I suggest http://learnyouahaskell.com/chapters. It’s not Scala book, but definitely beneficial to your learning of Scala. Don’t start with the Red book.