Timeline for is hash table a magic?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 30, 2018 at 0:10 | comment | added | breezeintopl | Thanks for your comments and suggestion! @Evil an others. I will study the basic algo and DS textbook. After a second thought, I think my actual question is "Given this problem, does the example $O(MN)$ code looks very stupid for cs people, and if their first thought is to use hash table to solve the problem like the interviewer?" | |
| Mar 29, 2018 at 22:39 | comment | added | D.W.♦ | It sounds like you should read an undergraduate-level textbook on data structures and algorithms. That will describe how hash tables work, and many other things that will be helpful to you in this sort of interview. The interview is probably testing your knowledge of computer science, so if you don't know much computer science, it's no surprise that you are having difficulty with the interview question. | |
| Mar 29, 2018 at 22:31 | comment | added | Yuval Filmus | If you want to work in computer science (programming or not), it's a terrific idea to study some computer science. | |
| Mar 29, 2018 at 22:30 | comment | added | Yuval Filmus | I'm not sure the question is appropriate for this site, or indeed anywhere on the network. You are basically asking for tips about how to find a job. | |
| Mar 29, 2018 at 22:21 | comment | added | Evil | It is not that simple, amortised / expected time... did you look at our answered questions about hash tables? What is your question? (There are several of them and context does matter a lot. For everyday programming tasks, yes. For somewhat stricter analysis, pesymistic case for look up is $\mathcal O(n)$...). It is nice to put a background, but I think, that question would fit in 3 lines. Nice one: cs.stackexchange.com/questions/249/when-is-hash-table-lookup-o1 | |
| Mar 29, 2018 at 22:03 | history | asked | breezeintopl | CC BY-SA 3.0 |