News for hackers. Stuff that matters.

_nt_

Re:Khan Academy: Algorithms on Sunday March 15, 2015 @05:51PM (#9208326)
It indeed is interesting question. The solution which comes first to mind is creating a graph, with words as vertices, edges will be only if two words have a difference of single character. Once this graph is created, it's matter of running shortest path algo between two vertices. However, creating the graph itself could be a bitch, depending on size of dictionary.

IP protection before approaching VC

Before approaching VCs, is it recommended to start patent process or some way to ensure protection of IP? Does it happen that some VC rejected an idea but gave away someone else refined or similar idea?

( Read More... | 5 comments | 8 points | on HN )