Data Structures & Algorithms

DS & ALgo Practice... mostyl in Javascript

• Data Structures & Algorithms

  • Algorithms
    • Books
    • Coding practice
    • Guides
    • Misc
  • Guides
    • Articles
    • Courses
    • Mock interviews
    • Q&A
    • Sites
    • Videos

• Languages and technologies

  • JavaScript
  • Node
  • PHP
  • Python
  • React
  • Math
  • Networking
  • System design
  • Resource Repos
  • MISC

Getting Started

To get a local copy up and running follow these simple steps.

Prerequisites

This is an example of how to list things you need to use the software and how to install them.

• npm

  npm install npm@latest -g

Installation

1. Clone the repo

   git clone https://github.com/github_username/repo_name.git

2. Install NPM packages

   npm install

Usage

Use this space to show useful examples of how a project can be used. Additional screenshots, code examples and demos work well in this space. You may also link to more resources.

For more examples, please refer to the Documentation

Contributing

Contributions are what make the open source community such an amazing place to be learn, inspire, and create. Any contributions you make are greatly appreciated.

1. Fork the Project
2. Create your Feature Branch (git checkout -b feature/AmazingFeature)
3. Commit your Changes (git commit -m 'Add some AmazingFeature')
4. Push to the Branch (git push origin feature/AmazingFeature)
5. Open a Pull Request

License

Distributed under the MIT License. See LICENSE for more information.

Contact

Email

[email protected]

Phone

551-254-5505

Social

• GitHub
• Gitlab
• Bitbucket
• code pen
• Glitch
• Instagram
• LinkedIn
• Replit
• Redit
• runkit
• stack-exchange
• Netlify

Resources!

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
  • Original [RU]
• vhf/free-programming-books
• it-ebooks.info
• S. Dasgupta, C. H. Papadimitriou, and U. V. Vazirani -Algorithms

Coding practice

• LeetCode
  • LeetCode w/ Explanations labuladong/fucking-algorithm
• 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]

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

• leetcode
• leetcode premium
• this pdf
• cracking the coding interview
• here
• topcoder
• back to back swe youtube channel
• solutions
• leetcode discuss
• grokking the coding interview
• issue
• blind 75 list
• 14 patterns to ace any coding interview question

.
├── DS-n-Algos
│   ├── 0-TESTING-RESOURCES
│   │   ├── main-data
│   │   └── text-2-js
│   ├── ALGO
│   │   ├── Dynamic-Programming
│   │   ├── LEETCODE
│   │   ├── UNSORTED
│   │   │   └── Hash Table Data-Structure
│   │   ├── binary_search_project
│   │   │   ├── lib
│   │   │   └── test
│   │   ├── callbacks-solution
│   │   │   ├── problems
│   │   │   └── test
│   │   ├── coin-change
│   │   │   ├── MINchange
│   │   │   │   └── test
│   │   │   ├── coinchange-memoized
│   │   │   └── itterative-4-fun
│   │   ├── computational-complexity
│   │   ├── dice-roll
│   │   ├── egg-drop
│   │   ├── factorial
│   │   ├── fibonacci
│   │   ├── memoization_project
│   │   │   ├── lib
│   │   │   └── test
│   │   ├── radix_sort_project
│   │   │   ├── lib
│   │   │   └── test
│   │   └── tabulation_project
│   │       ├── lib
│   │       └── test
│   ├── Arrays
│   │   ├── 53-max-subArr
│   │   ├── All Unique
│   │   │   └── test
│   │   ├── Array
│   │   ├── Array-Flatten
│   │   ├── Intersection
│   │   ├── Transpose-2-d-array
│   │   ├── all
│   │   ├── append-arr
│   │   ├── array-helpers
│   │   ├── array-of-cumulative-partial-sums
│   │   ├── array-of-nums-in-range
│   │   ├── atleast
│   │   ├── average
│   │   ├── basic-examples
│   │   │   └── problems
│   │   ├── deep-map
│   │   ├── difference-between-arrays
│   │   ├── flatten
│   │   ├── python
│   │   │   ├── sum-arr-dir
│   │   │   └── sum-avg
│   │   ├── resize-array
│   │   └── stringify-arr
│   ├── Binary-Trees
│   │   ├── 105-construct-b-tree
│   │   ├── leetcode110-balanced-bin-tree
│   │   └── tree_order_project
│   │       ├── lib
│   │       └── test
│   ├── Dynamic-Programming
│   │   ├── dynamic-time-warping
│   │   │   ├── doc
│   │   │   │   └── api
│   │   │   ├── lib
│   │   │   │   └── distanceFunctions
│   │   │   ├── ms
│   │   │   └── tests
│   │   ├── popular-problems
│   │   └── tabulation_project
│   │       ├── lib
│   │       └── test
│   ├── Fifo-Lifo
│   │   ├── Queue
│   │   ├── Stack
│   │   ├── queue_project
│   │   │   ├── lib
│   │   │   └── test
│   │   ├── stack_project
│   │   │   ├── lib
│   │   │   └── test
│   │   └── stack_queue_interview_problems
│   │       ├── lib
│   │       └── test
│   ├── File-System
│   │   ├── file-name-from-path
│   │   ├── file-utilities
│   │   ├── guessing-game
│   │   ├── is-valid-file-name
│   │   └── recursive-read-folder
│   ├── Graphs
│   │   ├── Graph
│   │   │   └── basic
│   │   ├── advanced
│   │   ├── bonus-graph-project
│   │   │   ├── lib
│   │   │   └── test
│   │   ├── graph_project
│   │   │   ├── lib
│   │   │   └── test
│   │   ├── graphs-intro-solution
│   │   │   ├── problems
│   │   │   └── test
│   │   └── graphs-solution
│   │       ├── problems
│   │       └── test
│   ├── Hash-Table
│   │   └── advanced
│   ├── Heap
│   ├── Lists
│   │   ├── Linked-List
│   │   ├── advanced
│   │   ├── linked_list_interview_problems
│   │   │   ├── lib
│   │   │   └── test
│   │   └── linked_list_project
│   │       ├── lib
│   │       └── test
│   ├── Misc
│   │   ├── console.table
│   │   ├── data-structures-html-spec-runner
│   │   │   ├── lib
│   │   │   │   ├── chai
│   │   │   │   ├── jquery
│   │   │   │   ├── mocha
│   │   │   │   ├── require
│   │   │   │   └── underscore
│   │   │   ├── sprint-one
│   │   │   │   ├── spec
│   │   │   │   └── src
│   │   │   │       ├── functional
│   │   │   │       ├── functional-shared
│   │   │   │       ├── prototypal
│   │   │   │       └── pseudoclassical
│   │   │   └── sprint-two
│   │   │       ├── spec
│   │   │       └── src
│   │   ├── heaps_project
│   │   │   ├── lib
│   │   │   └── test
│   │   ├── is-reserved-wordJS
│   │   ├── set-utils
│   │   ├── tree
│   │   ├── trie_project
│   │   │   ├── lib
│   │   │   └── test
│   │   ├── type-checker
│   │   └── whiteboarding
│   ├── Numbers_Math
│   │   ├── C++
│   │   ├── base-converter
│   │   ├── basic-examples
│   │   ├── euclidean-distance
│   │   └── isBase
│   ├── POJOs
│   │   ├── basic-examples
│   │   ├── clone
│   │   ├── extend-obj-prop
│   │   ├── obj2Array
│   │   └── objPropMap
│   ├── Recursion
│   │   ├── My-Recursion-Prac-Website
│   │   │   └── Live-htmlRendered-Mocha-Spec--Recursion-Practice-master
│   │   │       ├── AUX_MATERIALS
│   │   │       │   └── sandbox
│   │   │       ├── blank
│   │   │       │   ├── lib
│   │   │       │   │   └── css
│   │   │       │   ├── spec
│   │   │       │   ├── src
│   │   │       │   └── testing
│   │   │       ├── images
│   │   │       ├── my-solutions
│   │   │       │   ├── lib
│   │   │       │   │   └── css
│   │   │       │   ├── spec
│   │   │       │   └── src
│   │   │       ├── part-2
│   │   │       │   ├── lib
│   │   │       │   │   └── jasmine-1.0.0
│   │   │       │   ├── solutions
│   │   │       │   ├── spec
│   │   │       │   └── src
│   │   │       └── tabs
│   │   │           └── template-files
│   │   ├── Recursive
│   │   ├── binary-search
│   │   ├── fibonacci
│   │   │   └── __test__
│   │   ├── fibonacci-versions
│   │   ├── lucas-num-versions
│   │   ├── recursion_problems-master
│   │   │   ├── problems
│   │   │   │   └── dist
│   │   │   └── test
│   │   └── recursion_project
│   │       ├── lib
│   │       └── test
│   ├── Sorting-n-Searching
│   │   ├── 1-searching-algorithms
│   │   │   ├── Search
│   │   │   └── depth_breadth_first_project
│   │   │       ├── lib
│   │   │       └── test
│   │   └── 2-sorting-algorithms
│   │       ├── Sorts
│   │       ├── bubble_sort_project
│   │       │   ├── lib
│   │       │   └── test
│   │       ├── counting_sort_project
│   │       │   ├── lib
│   │       │   └── test
│   │       ├── insertion_sort_project
│   │       │   ├── lib
│   │       │   └── test
│   │       ├── merge_sort_project
│   │       │   ├── lib
│   │       │   └── test
│   │       ├── quick_sort_project
│   │       │   ├── lib
│   │       │   └── test
│   │       ├── radix_sort_project
│   │       │   ├── lib
│   │       │   └── test
│   │       └── selection_sort_project
│   │           ├── lib
│   │           └── test
│   ├── Strings
│   │   ├── 03-lengthOfLongestSubString
│   │   ├── C++
│   │   │   ├── escape-quotes
│   │   │   ├── remove-quotes
│   │   │   └── trim-white-space
│   │   ├── String
│   │   │   └── test
│   │   ├── python
│   │   │   ├── reverse-word
│   │   │   └── split-string
│   │   └── string-helpers
│   ├── Trees
│   │   ├── Binary-Search-Tree
│   │   ├── Tree
│   │   ├── advanced
│   │   ├── bfs-vs-dfs
│   │   ├── leetcode-450-delete-bst-node
│   │   ├── leetcode108-sorted-arr-2-bst
│   │   └── tree_order_project
│   │       ├── lib
│   │       └── test
│   ├── Utilities-Snippets
│   │   ├── general
│   │   └── whitespace-identifier
│   ├── _Extra-Practice
│   │   ├── anagrams
│   │   ├── bst
│   │   ├── capitalize
│   │   ├── chunk
│   │   ├── circular
│   │   ├── events
│   │   ├── fib
│   │   ├── fizzbuzz
│   │   ├── fromlast
│   │   ├── levelwidth
│   │   ├── linkedlist
│   │   ├── matrix
│   │   ├── maxchar
│   │   ├── midpoint
│   │   ├── palindrome
│   │   ├── pyramid
│   │   ├── qfroms
│   │   ├── queue
│   │   ├── reverseint
│   │   ├── reversestring
│   │   ├── sorting
│   │   ├── stack
│   │   ├── steps
│   │   ├── tree
│   │   ├── validate
│   │   ├── vowels
│   │   └── weave
│   ├── functions
│   │   ├── HASH
│   │   ├── MemoizeFunc
│   │   ├── bindTo
│   │   └── call-closure
│   ├── temp
│   └── web-dev
│       ├── convert-2-js-arr
│       ├── html-2-text
│       ├── listenForEvent-s
│       └── tagify-arr
└── Resources
    ├── My-Data-Structures-Notes
    │   ├── tiny-prac-probs
    │   │   └── problems
    │   └── z-NOTES
    │       ├── async_await
    │       ├── choosing_the_right_approach
    │       ├── concepts
    │       ├── data-structures
    │       ├── introducing
    │       ├── promises
    │       └── timeouts_and_intervals
    └── gitserve

309 directories