Lest I Forget

Archive

  2. power sum of a choice

    A really nice problem occured in ABC 471, if I was smarter I would’ve been able to solve it faster but I did get to a solution and was satisfied with just that too; but to get better must distill it.

  3. LRU Cache

    Requirements: a maximum capacity get(key) + mark as recent put(key,value) + mark as recent + evict oldest one if inserting ( not updating )at capacity both should be average O(1) high level idea A hashmap is definitely involed to back as the key value store.

  4. Beyond - an infinite canvas for programmers

    I wanted to have a simple polished open source app that treats code as first class; nothing fancy like an LSP but just a little bit of syntax highlightin would be nice.

  5. What is this?

    Well, I hope to document some of the design decisions and tradeoff, the “human” touch in the different things I make.

  6. Ingenuity

    This is a list of problems with deceptively simple solutions, all that I might’ve either completely missed or arrived at via a contrived way losing the essence and intuition of it.

  8. Bitmask DP

    Bitmask DP Considerations? Do I iterate over set bits and remove them? Is optimal structure a vine Do I iterate over submasks and remove them? Is optimal structure a tree Think bitmask dp, when iterating over permutations of processing order would works.

  9. Digit DP

    Digit DP Typical state: position, tight bound, leading-zero state, and the problem-specific state.

  10. Knapsack

    Knapsack Fractional knapsack greedy, sort items by value/wt and pick max ones 0/1 Knapsack - O(nw) time and O(nw) space variant def: f(w) ⇒ max value s.t.