Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.

Awesome Lists | Featured Topics | Projects

https://github.com/davidhampgonsalves/interview-resources

long list of resources for preparing for technical computer engineering interviews
https://github.com/davidhampgonsalves/interview-resources

featured interview-preparation

Last synced: about 2 months ago
JSON representation

long list of resources for preparing for technical computer engineering interviews

Host: GitHub
URL: https://github.com/davidhampgonsalves/interview-resources
Owner: davidhampgonsalves
License: mit
Created: 2014-01-24T02:07:08.000Z (almost 11 years ago)
Default Branch: master
Last Pushed: 2017-08-31T11:46:32.000Z (over 7 years ago)
Last Synced: 2024-08-02T14:12:18.593Z (5 months ago)
Topics: featured, interview-preparation
Homepage:
Size: 3.91 KB
Stars: 434
Watchers: 24
Forks: 111
Open Issues: 0
Metadata Files:
- Readme: README.md
- License: LICENSE

Awesome Lists containing this project

awesome-starred-test - davidhampgonsalves/interview-resources - long list of resources for preparing for technical computer engineering interviews (Others)

README

        interview-resources

===================

long list of resources for preparing for technical computer engineering interviews. 

# Short List

* [big-O cheat sheet](http://bigocheatsheet.com/#data-structures) - Refresher on the complexity of various algorithms.

* [Design Patterns](http://viralpatel.net/blogs/download/design-pattern-scard.pdf) - Quick reference of design patterns.

* [Sorting Algorithm Animation](http://www.sorting-algorithms.com/) - Sorting algorithms visualised.

* [Hacking a Google Interview Course Notes](http://courses.csail.mit.edu/iap/interview/materials.php) - General problems and prep suggestions(confidence booster).

* [MIT Intro to Algorithms Lectures](http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j-introduction-to-algorithms-sma-5503-fall-2005/video-lectures/) - Good to listen to in the background or before bed.

* [Skiena's Algorithms Lectures](http://www.cs.sunysb.edu/~algorith/video-lectures/) - Video/audio, great for train rides and long commutes.

* [Project Euler](http://projecteuler.net) - Problem solving skills.

* [Google Guava Source](https://code.google.com/p/guava-libraries/) - (Java)Review [source](https://code.google.com/p/guava-libraries/source/browse/) since it covers implementing collections, concurrency, etc.

# Notable Post Interview Blog Posts

* [Steve Yegge: Google](http://steve-yegge.blogspot.com/2008/03/get-that-job-at-google.html)

* [Steve Yegge: Phone Screen](https://sites.google.com/site/steveyegge2/five-essential-phone-screen-questions)

* [David Byttow: ABC - Always Be Coding](https://medium.com/tech-talk/d5f8051afce2)

* [David Byttow: Four Steps to Google, Without a Degree](https://medium.com/this-happened-to-me/8f381aa6bd5e)

* [Joel Spolsky: The Guerrilla Guide to Interviewing](http://www.joelonsoftware.com/articles/GuerrillaInterviewing3.html)

# Long List of Wikipedia Resources

* [Big-O](http://en.wikipedia.org/wiki/Big_O_notation)

* [Bitwise](http://en.wikipedia.org/wiki/Bitwise_operation)

* [Dynamic Programming](http://en.wikipedia.org/wiki/Dynamic_programming)

* [Fibonacci Numbers](http://en.wikipedia.org/wiki/Fibonacci_numbers)

## Common Problems

* [Partition](http://en.wikipedia.org/wiki/Partition_problem)

* [Shortest Path](http://en.wikipedia.org/wiki/Shortest_path_problem)

* [Traveling Saleman](http://en.wikipedia.org/wiki/Travelling_salesman_problem#As_a_graph_problem)

## Sorts

* [Merge](http://en.wikipedia.org/wiki/Merge_sort)

* [Quick](http://en.wikipedia.org/wiki/Quick_sort)

* [Heap](http://en.wikipedia.org/wiki/Heapsort)

* [Insertion](http://en.wikipedia.org/wiki/Insertion_sort)

* [Selection](http://en.wikipedia.org/wiki/Selection_sort)

* [Bubble](http://en.wikipedia.org/wiki/Bubble_sort)

* [Radix](http://en.wikipedia.org/wiki/Radix_sort)

## [Data Structures](http://en.wikipedia.org/wiki/List_of_data_structures)

* [Heap](http://en.wikipedia.org/wiki/Heap_(data_structure))

* [Linked List](http://en.wikipedia.org/wiki/Linked_list)

* [Tree](http://en.wikipedia.org/wiki/Tree_(data_structure))

* [Hash Table](http://en.wikipedia.org/wiki/Hash_table)

* [Queue](http://en.wikipedia.org/wiki/Queue_(data_structure))

* [Stack](http://en.wikipedia.org/wiki/Stack_(data_structure))

* [Graph](http://en.wikipedia.org/wiki/Graph_(abstract_data_type))

### Heaps

* [Binary Heap](http://en.wikipedia.org/wiki/Binary_heap)

* [Binomial Heap](http://en.wikipedia.org/wiki/Binomial_heap)

* [Fibonacci Heap](http://en.wikipedia.org/wiki/Fibonacci_heap)

### Trees

* [Traversal](http://en.wikipedia.org/wiki/Tree_traversal)

* [B-Tree](http://en.wikipedia.org/wiki/B-tree)

* [Trie](http://en.wikipedia.org/wiki/Trie)

* [Suffix Tree](http://en.wikipedia.org/wiki/Suffix_tree)

### Graphs

* [Graph Theory](http://en.wikipedia.org/wiki/Graph_theory)

* [Graph Search](http://en.wikipedia.org/wiki/Graph_search_algorithm)

    * [DFS](http://en.wikipedia.org/wiki/Depth-first_search)

    * [BFS](http://en.wikipedia.org/wiki/Breadth-first_search)

    * [Nearest neighbour](http://en.wikipedia.org/wiki/Nearest_neighbour_algorithm)

    * [Dijkstra's algorithm](http://en.wikipedia.org/wiki/Dijkstra%27s_algorithm)

## Design Patterns

* [State](http://en.wikipedia.org/wiki/State_pattern)

* [Memento](http://en.wikipedia.org/wiki/Memento_pattern)

* [Interpreter](http://en.wikipedia.org/wiki/Interpreter_pattern)

* [Strategy](http://en.wikipedia.org/wiki/Strategy_pattern)

* [Mediator](http://en.wikipedia.org/wiki/Mediator_pattern)

* [Visitor](http://en.wikipedia.org/wiki/Visitor_pattern)

* [Proxy](http://en.wikipedia.org/wiki/Proxy_pattern)

* [Bridge](http://en.wikipedia.org/wiki/Bridge_pattern)

* [Abstract](http://en.wikipedia.org/wiki/Abstract_factory_pattern)

* [Composite](http://en.wikipedia.org/wiki/Composite_pattern)

* [Observer](http://en.wikipedia.org/wiki/Observer_pattern)

* [Command](http://en.wikipedia.org/wiki/Command_pattern)

* [Iterator](http://en.wikipedia.org/wiki/Iterator_pattern)

* [Template](http://en.wikipedia.org/wiki/Template_pattern)

* [Adapter](http://en.wikipedia.org/wiki/Adapter_pattern)

* [Builder](http://en.wikipedia.org/wiki/Builder_pattern)

* [Decorator](http://en.wikipedia.org/wiki/Decorator_pattern)

* [Factory](http://en.wikipedia.org/wiki/Factory_pattern)

* [Facade](http://en.wikipedia.org/wiki/Facade_pattern)

* [Prototype](http://en.wikipedia.org/wiki/Prototype_pattern)

* [Flyweight](http://en.wikipedia.org/wiki/Flyweight_pattern)

* [Singleton](http://en.wikipedia.org/wiki/Singleton_pattern)