Algorithms
Books
- Steven Skiena – The Algorithm Design Manual
- Udi Manber – Introduction to Algorithms: A Creative Approach
- Cormen, Leiserson, Rivest, Stein – Introduction to Algorithms
- Sedgewick, Wayne – Algorithms
- Antti Laaksonen – Competitive Programmer’s Handbook
- Steven & Felix Halim – Competitive Programming
- Jon Bentley – Programming Pearls
- E-Maxx Algorithms
- vhf/free-programming-books
- it-ebooks.info
- S. Dasgupta, C. H. Papadimitriou, and U. V. Vazirani -Algorithms ### Coding practice
- LeetCode
- InterviewBit
- Codility
- HackerRank
- Project Euler
- Spoj
- Google Code Jam practice problems
- HackerEarth
- Top Coder
- CodeChef
- Codewars
- CodeSignal
- CodeKata
- Firecode ### Guides
- GeeksForGeeks – A CS portal for geeks
- Learneroo – Algorithms
- Top Coder tutorials
- Infoarena training path (RO)
- Steven & Felix Halim – Increasing the Lower Bound of Programming Contests (UVA Online Judge) ### Misc
- Top 10 Algorithms in Interview Questions
- Hard interview questions that have a short recursive solution
- Grow Your Technical Skills with Google ## Guides ### Articles
- Steve Yegge – Get That Job at Google
- Steve Yegge – Ten Tips for a (Slightly) Less Awful Resume
- Carlos Bueno – Get That Job at Facebook
- Daniel Blumenthal – How to Prepare for Technical Interviews
- David Byttow – ABC: Always Be Coding
- David Byttow – Four Steps to Google, Without a Degree
- Thomas L. Friedman – How to Get a Job at Google [part 1] [part 2]
- Andrew Rothbart – Preparing for a technical interview with programming contests
- Mina Azib – Resources for Preparing for the Google Interview
- u/RunninADorito – How to Prepare for Tech Interviews
- Bill Sourour – How To Win the Coding Interview
- Ammon Bartram – How To Pass a Programming Interview ### Courses
- MIT – Hacking a Google Interview
- Algorithms: Design and Analysis
- Algorithms and Data Structures - Part 1
- Algorithms and Data Structures - Part 2 ### Mock interviews
- interviewing.io
- Pramp “Practice coding interviews for free”
- Refdash
- Gainlo
- Candidacy.io
- Skilled
- Gainlo ### Q&A
- How to prepare for my Google/Facebook interview if I have 6 months left?
- How should I prepare for my Google interview if I have 1 month left?
- What is the best advice for an engineering internship interview at Google or Facebook?
- What graph topics should I study in order to be adequately prepared for a Google Software Engineer interview? ### Sites
- Coding for Interviews
- Career Cup
- HiredInTech
- Codela
- TestDome
- FreeCodeCamp “Learn to code and help nonprofits”
- Dynamic Programming Practice Problems
- Codility Lessons
- Introduction to Theoretical Computer Science ### Videos
- How to: Work at Google – Candidate Coaching Session for Technical Interviewing [45:45]
- Gayle McDowell – Cracking the Coding Interview [1:14:24]
- Gayle McDowell - Cracking the Coding Interview (examples) [9:05]
- Google Recruiters Share Technical Interview Tips [31:06]
- Google Recruiters Share Non-Technical Interview Tips [28:23]
- Moishe Lettvin – What I Learned Doing 250 Interviews at Google [1:00:24]
- Sean Lee – How to Get a Job at the Big 4 [42:34]
- Ladies Storm Hackathons – Interview Prep Round 1: Strings, Arrays, Linked Lists [1:12:39]
- Randall Koutnik – Rethinking the Developer Career Path [25:03] # Languages and technologies ### JavaScript
- Free books by Dr. Axel Rauschmayer
- You Don’t Know JS
- Superhero.js
- h5bp/Front-end-Developer-Interview-Questions ### Node
- Node.js Best Practices and Tips
- Node.js Interview - Guide ### PHP
- PHP The Right Way ### Python
- The Hitchhiker’s Guide to Python
- quantifiedcode/python-anti-patterns
- The Insider’s Guide to Python Interviewing
- Book: Elements of Programming Interviews in Python ### React
- markerikson/react-redux-links
- 12 Essential React.js Interview Questions
- React Interview Questions ### Math
- MIT - Mathematics for Computer Science
- Graham, Knuth, Patashnik – Concrete Mathematics: A Foundation for Computer Science
- Bogart, Drysdale, Stein – Discrete Math for Computer Science Students ### Networking
- Joyent – TCP Puzzlers
- Andrew Tanenbaum – Computer Networks
- Kurose, Ross – Computer Networking: A Top-Down Approach
- W. Richard Stevens – TCP/IP Illustrated, Vol. 1: The Protocols
- W. Richard Stevens – UNIX Netowrk Programming ### System design
- donnemartin/system-design-primer
- binhnguyennus/awesome-scalability
- Architecture of Open Source Applications
- How should I prepare system design questions for Google/Facebook interview? ## Resource Repos
- MaximAbramchuck/awesome-interview-questions
- donnemartin/interactive-coding-challenges
- schmatz/cs-interview-guide
- mission-peace/interview
- prakhar1989/awesome-courses
- SITZ/JobPuzzles
- davidhampgonsalves/interview-resources
- blakeembrey/code-problems
- ChiperSoft/InterviewThis
- ruby-jokes/job_interview
- what-happens-when
- poteto/hiring-without-whiteboards
- liwei606/interview
- yangshun/tech-interview-handbook
MISC
``````
tree -d -L 4 . ├── Complete │ ├── c++ │ ├── java │ ├── js │ ├── language-agnostic │ └── shell ├── In-Progress │ ├── gs-interview-problems │ │ ├── Length-Encoding │ │ ├── Longest-Uniform-String │ │ ├── Search Tree │ │ ├── Second-Smallest │ │ ├── count-length-of-cycle │ │ ├── election │ │ └── walking-robot │ └── recursion-prompts-master │ ├── lib │ │ └── css │ ├── spec │ └── src ├── Not-My-Solutions │ └── data-structs-js │ └── markdown ├── Prac-Projects │ ├── 0-complete │ │ ├── binary_search_project │ │ │ ├── lib │ │ │ └── test │ │ ├── bubble_sort_project │ │ │ ├── lib │ │ │ └── test │ │ ├── counting_sort_project │ │ │ ├── lib │ │ │ └── test │ │ ├── depth_breadth_first_project │ │ │ ├── lib │ │ │ └── test │ │ ├── graph_project │ │ │ ├── lib │ │ │ └── test │ │ ├── heaps_project │ │ │ ├── lib │ │ │ └── test │ │ ├── insertion_sort_project │ │ │ ├── lib │ │ │ └── test │ │ ├── linked_list_interview_problems │ │ │ ├── lib │ │ │ └── test │ │ ├── linked_list_project │ │ │ ├── lib │ │ │ └── test │ │ ├── memoization_project │ │ │ ├── lib │ │ │ ├── linked_list_project │ │ │ └── test │ │ ├── merge_sort_project │ │ │ ├── lib │ │ │ └── test │ │ ├── queue_project │ │ │ ├── lib │ │ │ └── test │ │ ├── quick_sort_project │ │ │ ├── lib │ │ │ └── test │ │ ├── radix_sort_project │ │ │ ├── lib │ │ │ └── test │ │ ├── recursion_project │ │ │ ├── lib │ │ │ └── test │ │ ├── selection_sort_project │ │ │ ├── lib │ │ │ └── test │ │ ├── stack_project │ │ │ ├── lib │ │ │ └── test │ │ ├── stack_queue_interview_problems │ │ │ ├── lib │ │ │ └── test │ │ ├── tabulation_project │ │ │ ├── lib │ │ │ └── test │ │ └── tree_order_project │ │ ├── lib │ │ └── test │ └── 1-incomplete ├── Resources │ ├── _MY_SNIPPETS │ │ ├── 0-TESTING-RESOURCES │ │ │ ├── data │ │ │ └── type-checker │ │ ├── Array │ │ │ ├── Intersection │ │ │ ├── Transpose-2-d-array │ │ │ ├── all │ │ │ ├── append-arr │ │ │ ├── array-helpers │ │ │ ├── array-of-cumulative-partial-sums │ │ │ ├── atleast │ │ │ ├── average │ │ │ ├── flatten │ │ │ ├── general-use-helpers │ │ │ ├── num-helpers │ │ │ └── string-helpers │ │ ├── Browser │ │ │ └── listenForEvent-s │ │ ├── Date&Time │ │ ├── MemoizeFunc │ │ ├── console.table │ │ ├── function │ │ │ └── bindTo │ │ ├── misc-documentation │ │ ├── node-specific │ │ │ └── recursive-install-dependencies │ │ ├── objects │ │ │ └── obj2Array │ │ └── search-and-sort │ │ ├── Binary-Search-Tree │ │ └── sorting │ ├── algorithms │ │ ├── searching-algorithms │ │ └── sorting-algorithms │ ├── basic-data-structures │ ├── helper-functions │ │ ├── array-helpers │ │ ├── general-use-helpers │ │ ├── num-helpers │ │ └── string-helpers │ ├── memoization-tabulation │ │ ├── fibonacci-versions │ │ └── lucas-num-versions │ ├── problem-solving-patterns │ └── reference-docs └── promts-and-problems ├── Projects-master └── leetcode
137 directories
___________________________________________________ bryan_dir:DS-and-Algorithms-Prac_exitstatus:0 ====> ```