Contents:

...

Algorithms-Specific Informational Websites (not programming challenge websites)

• Nick Parlante - Pointers, Binary Trees, etc.

• OpenDSA

  • Very good explanations

• GeeksForGeeks
  • OK explanations
• Jason Park - Algorithm Visualizer
• Khan Academy - Algorithms
• Treehouse

...

Interview Prep sites

• CareerCup
  • rec'd by Choketsu
    
• Codility
  • Lessons
  • Challenges
  • Rec'd by Toptal
• Cracking the Coding Interview - Video Interviews
• HackerRank
  • rec'd by Choketsu
• InterviewBit
  • via Tom A.
• Interview Cake
  
• Tech Interview Handbook (GitHub project)

Non-Interview-Prep Challenge sites

...

Topics

Linked Lists

• Jesse Farmer - Loops in linked lists
• Nick Parlante:
• Linked List Basics
• • Linked List Problems

...

Flashcards

• Here is an explanation of how to programmatically create Anki deck packages: http://decks.wikia.com/wiki/Anki_APKG_format_documentation
• Here's an example of people collaborating on an Anki deck: http://decks.wikia.com/wiki/Main_Page
• Javascript problem manager: https://github.com/imaginate/algorithmIV-question-manager
• https://www.oxbridgenotes.com/articles/janki_method_refined

• The stages of understanding: (think about it as high-level vs. low-level understanding, or broad vs. deep understanding)
  1. Broad / High-level: Recognition of terms / basic understanding of definitions
  2. High / Mid-level Knowing when to use a particular tool
  3. Mid/Low-level: Knowing how to do something
  4. Deep / Low-level: Knowing about tricky things / edge cases / less-common problems

• Algorithms
  • Testing recognition / basic understanding
    • What does "BFS" stand for?
      • Acronym used in IK
  • Give an example of an O(X) algorithm.  ← See 'The Pragmatic Programmer' for examples.
    • Give an example of an O(1) algorithm.
    • Give an example of an O(lg(n)) algorithm.
      • "Binary search of a sorted list, traversing a binary tree, and finding the first set bit in a machine word(?)."
    • Give an example of an O(n) algorithm.
      • Exhaustive searches, finding the maximum value in an array, and generating checksums.
    • Give an example of an O(m * n) algorithm.
      • "This commonly occurs in simple sorting algorithms, such as bubble sort, where the outer loop scans each element in the array in turn, and the inner loop works out where to place that element in the sorted result."
    • Give an example of an O(n*lg(n)) algorithm.
      • Quicksort
    • Give an example of an O(n^2) algorithm.
    • Give an example of an O(n^3) algorithm.
    • Give an example of an O(2^n) algorithm.
    • Give an example of an O(n!) algorithm.
      • "Whenever algorithms start looking at the permutations of things, their running times may get out of hand. (...) Examples include algorithms for many of the acknowledged 'hard' problems–the traveling salesman problem, optimally packing things into a container, partitioning a set of numbers so that each set has the same total, and so on. Often, heuristics are used to reduce the running times of these types of algorithms in particular problem domains."
• Arrays and other Ad-hoc problems
• Concurrency
• Dynamic Programming
• Graphs and other Data Structures
• Group coding mocks
• Group mocks on Concurrency
• Group mocks on Object Modeling
• Group mocks on Scalable Systems
• Linked Lists, Stacks, and Queues
• Object Modeling
• Orientation + Behavioral
• Recursion
• Scalable Systems
• Sorting
• Strings
• Trees
  • Done - K-ary tree
    • Used in IK
  • BST
    • Used in IK