Template:ProgrammingStragetySheet

• DEFINE PROBLEM
  • draw example (i/o)
  • assumptions
    • data types / limits / range / edge cases
• ANALYZE
  • brainstorm:
    • strategies: ...... bitwise, recursive, flip, swap, pointers, two-pointer, dynamic
    • search: ......... binary (low/high), nested loop (look ahead), reverse (look behind)
    • data structs: ... hash, stack/queue, heap, tree, graph, suffix arr, bit vector, list
    • sorts: ........... insertion, merge, m quicksort, heap, bucket
  • time/space (O(n))
• IMPLEMENT
  • code / explain
• TEST
  • examples
  • edge cases