Sort by

recency

|

51 Discussions

|

  • + 3 comments

    Has anyone here ordered a custom piece of jewelry online? I’m trying to figure out if it’s worth going that route versus sticking with the limited options local jewelers provide. I’m looking for something specific for an engagement, but stores in my area mostly just carry standard designs. Did you find the online process confusing, or was it pretty straightforward?

  • + 1 comment

    We want wedding bands that feel symbolic of our relationship, not just a generic set you can buy anywhere. I’m wondering if personalized rings are really worth the effort compared to picking something simple off the shelf. Did anyone here try customizing, and how did it go?

  • + 0 comments

    What worked for me was to avoid floating math entirely: normalize rates and amounts to integers (basis points, cents), and compute costs with prefix sums over time “events.” Greedy fails when later cheaper windows exist, so I modeled feasibility and used a binary search on the final cost/limit, validating with a linear check per mid. Mid-way through debugging I realized that, like finances in real life, clarity beats guesswork; a concise guide on checking one’s credit history helped me think more systematically: https://lovilave.com.ua/blog/yak-pereviryty-svoyu-kredytnu-istoriyu. Back to code—pre-sort events, consolidate identical timestamps, and add tests for zero/very high interest, exact boundary fits, and cumulative overflow. This stabilized both performance and accuracy.

  • + 0 comments

    I’m working on the Borrowing Money challenge and I’m unsure about the right modeling. Is this solvable with a greedy strategy, or do we need DP / binary search over an answer? The tricky parts for me are precision (floats vs integers), large input sizes, and edge cases like zero-interest periods or ties where borrowing now vs later costs the same. Any hints on structuring the state and avoiding precision traps would be appreciated.

  • + 0 comments

    Very interesting, thanks, guys!