Live data from Hacker News

Viewing profile — behdad

behdad

HN member
Joined
Thu, Mar 08, 2012, 6:12 PM UTC
HN karma
207
Public activity
54 items

About behdad

No profile information was provided.

Recent public activity

  1. comment
    Comment #47668965

    msdf still suffers from detail loss at large sizes, which this method doesn't have.

  2. comment
    Comment #46910330

    A wave of manic energy in December had me put together a long deck called "HarfBuzz at 20! " , celebrating 20 years of HarfBuzz. I designed the deck to be presented at the #WebEngi…

  3. story
  4. comment
    Comment #45192124

    I have a puzzle for the hacker in you: The font HarfBust.ttf is an offshoot of Anton Regular, with a twist: - On software using HarfBuzz (as far back as you go, back to the 2000s) …

  5. story
  6. comment
    Comment #44655823

    Thank you for the question. Rasterization is not my specialty. There definitely is still immense amount of research going into rasterizing fonts and 2D graphics on the GPU efficien…

  7. comment
    Comment #44645206

    We’re the maintainers of HarfBuzz, the open-source text shaping engine used by browsers, operating systems, and applications to render all text, including supporting scripts like A…

  8. story
  9. comment
    Comment #40912464

    Browser zoom works fine for me. Does it not for you?

  10. comment
    Comment #40912456

    Hi. As mentioned, I'll expand on my motivations in a future paper. -behdad

  11. comment
  12. story
  13. comment
    Comment #35550958

    Like it or not for hiring purposes it does.

  14. comment
    Comment #35550870

    How does that work with new grads?

  15. comment
    Comment #35550787

    Assuming that the dictionary is arbitrary as well, just comparing the string to the strings in the dictionary (or hashing it) it takes O(n), regardless of the data-structure you us…

  16. comment
    Comment #35550742

    That is a correct solution. The one I was talking about would stop after just trying "The" and "reis".

  17. comment
    Comment #35550629

    My bad. The dictionary should be {"the", "there", "is"}.

  18. comment
    Comment #35550627

    Imagine the string "there is", and the dictionary {"the", "there", "is"}.

  19. comment
    Comment #35550494

    I beg to differ, this is exactly the opposite of a manhole problem, which I tried to explain, which I clearly failed.

  20. comment
    Comment #35550181

    My mid-mark would be where someone could write the code for the brute-force answer for both parts but couldn't get the memoize / dynamic-programming solution. That would be where I…

  21. comment
    Comment #35550110

    You'd be surprised.. but we're trying to distinguish between someone who can code simple algorithms versus one who can't.

  22. comment
    Comment #35550033

    Typically candidates are scored on a scale. And there are multiple interviews. The final hire / no-hire is decided based on the scores and written feedback from all interviews.

  23. comment
    Comment #35549987

    It is true that many companies, Google included, have added area-specific questions including some for frontend webdev if I remember correctly.

  24. comment
    Comment #35549947

    As someone who actually uses algorithms and data-structures in their job, I disagree.

  25. comment
    Comment #35549932

    Thanks. That's definitely an interesting question. How does it do with new grads? How do you grade people on that on a numerical scale? Curious.