News for hackers. Stuff that matters.

A comment on Ask HN: What does it take to get a job at Google?. Parent comment

Re:Ask HN: What does it take to get a job at Google? by fspear on Wednesday August 17, 2016 @07:12AM (#12303778)
Can you suggest any resources to freshen up on big o notation and fundamental data structures & algorithms that are not academically dense (i.e CLRS)?

I'm currently working through Cracking the coding interview & Elements of programming interviews but I really need to revisit the fundamentals, specially recurrence relations and calculating the order of complexity for an algorithm but I can't find any resources that are not too academically verbose, I have a really hard time reading mathematical notation.

[ Parent | on HN ]
Re:Ask HN: What does it take to get a job at Google? by thalesfc on Wednesday August 17, 2016 @03:11PM (#12307471)
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.

[ Parent | on HN ]
Re:Ask HN: What does it take to get a job at Google? by lil1729 on Wednesday August 17, 2016 @07:40AM (#12303888)
The Stanford/Coursera course on algorithms part 1 is a good resource for Big O. Knuth's "Concrete mathematics", 9th chapter (I think) has some good coverage on Big-O/Omega notation.
[ Parent | on HN ]