Recent submissions

Comment · 2 years ago
thanks!
Comment · 2 years ago
hey Dave,

what would you recommend if someone wanted to go from nothing (maybe some softw. experience) to be able to do a hardware design like this? Is there any book/courses you consider to be a must?

Comment · 8 years ago
Would you consider a non-senior for this position?
Comment · 10 years ago
tutorials

http://thiagomarzagao.com/2013/11/17/webscraping-with-seleni...

videoblog

https://github.com/kjam/python-web-scraping-tutorial/blob/ma...

The first link is a straight following link, and the second one is a 30mimn video that goes through all available Python crawlers.

My recommendation: follow the first one if you are sure to use selenium or watch the second link to check all possibilities.

Comment · 10 years ago
thanks
Comment · 10 years ago
Use selenium.py, it is by far the easiest and scalable solution out there. (believe me I have tried everything, beautiful soup, request.py, scrapy.py ... )
Comment · 10 years ago
Oh I see.
Comment · 10 years ago
Excellent content. I was surfing your web page and it seems ridiculous interesting. Tomorrow I will read everything, do you make all your source code available ?
Comment · 10 years ago
I just came across this link, it is a very intuitive and well-written explanation about the subject.
Comment · 10 years ago
This is my personal recommendation, please notice that I have read "Introduction to Algorithm by Cormen" about 4 years ago, so for me everything was more a catch up than really learning:

- Skiena algorithm book: https://www.amazon.com/Algorithm-Design-Manual-Steve-Skiena/...

for this book one can focuses on the first 7 chapters (revision)

- Leet code editorial solutions https://leetcode.com/articles/ . They provide with the solution and complexity analysis of a few problems. I suggest you try to solve and give your complexity analysis then compare it with the "official" one.

Comment · 10 years ago
I also want to add my 2 cents on that. I am terrible at white-board/ phone interviews but recently I think I was able to crack at it, and here are my thoughts about it:

- go to the root of the problem, run some examples by hand and try to think as a computer. e.g., I was at apple interview and there was this trick question that could be solved using a modified version of binary search. When I ran some example I kept asking myself "if I know that this element in the middle of the matrix is smaller (or larger) than X, what does that mean?"

- be very comfortable about big O notation. If necessary, be ready to present some formula.

- show that you can do the brute force solution. Sometimes the brute force solution seems very stupid (e.g., enumerate all possible subsets and find the best one), but you need to say it!

- most of all, be confident, but not arrogant. It is not the end of the world to not know something, but it is important to show what you do know!

Live from the official Hacker News API

A modern reader for Hacker News · SvelteKit + Skeleton