Problem Bank

1. Tips to Succeed

   1. Typing faster
   2. Understanding different language strengths/weaknesses
   3. The art of testing & Algorithm analysis 1. Special cases 2. Python scripts/vim to create big input 3. Big O

2. Reading in input

   Problems

   1. Taking in input in multiple languages
      1. C++
      2. Python
      3. Java
   2. Common pitfalls in output
      1. Debugging statements
   3. Using Linux to mimic online Judges
      1. A.out > input.in
   4. C++ - cin/cout v C - printf/scan

3. Linear Data Structures

   1. Static Arrays
      1. When we know max size
      2. Mapping
         1. Mapping of ASCII alphabet
   2. Dynamic Arrays
      1. When unknown size
      2. 2D arrays
   3. Linked Lists
      1. Understand Structure
      2. Benefits
      3. When to use vs. Array
   4. Sorting
      1. N^2 sorting
         1. Stable sorting
      2. NlogN sorting
         1. Built-In Sort
            1. Customize sorting

4. Map, Set, Hashing

   1. Unordered_map
      1. Difference between ordered_map
   2. Unordered_set
      1. multiset
   3. Custom hashing

5. Graph Problems

   1. Trees
      1. Binary Search Tree
      2. Heaps
   2. Graphs
      1. Directed v. Undirected
      2. Breadth First Search
      3. Depth First Search
      4. Topological Sort
      5. Minimum Spanning Tree
         1. Kruskal’s Algo.
         2. Prism’s Algo.
      6. Single Source Shortest Path
         1. Dijstra’s Algo.
      7. All-Pairs Shortest Path
         1. Kruskal's Algo.

6. Problem Solving Paradigms

   1. Divide and Conquer
   2. Greedy Algorithms
   3. Dynamic Programming