Steps to answer

  1. Listen carefully.
    • Pay very close attention to any information.
  2. Draw an example.
    1. Specific. Sufficiently large. Not a special case.
  3. State a brute force
    1. The initial solution may be terrible. Explain the space/time complexity.
  4. Optimize
    1. Look for any unused information
    2. Use a fresh example
    3. Solve it incorrectly.
    4. Make time vs. space tradeoff
    5. Precompute
    6. Use a hash table
    7. Think about the best conceivable runtime
    8. Walk through with Bottleneck, Unnecessary work and Duplicated work
  5. Implement
  6. Test



  1. BUD
  2. DIY
  3. Simplify and generalize
  4. Base case and build
  5. Data structure brainstorm
  6. BCR



Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )


Connecting to %s