merge

Author: jessicayung

.gitignore

@@ -1 +1,2 @@
 .idea
+algorithms/__pycache__/

README.md

@@ -1,8 +1,21 @@
-# programming-problems
+# algorithms-programming-problems
 Notes and code from HackerRank Challenges and other programming problems.
 
+**NOTE: I am working to expand the Algorithms directory. I do not have plans to expand on the other directories in the short term.**
+
 ## Contents
-### Problem Areas
+
+1. Algorithm implementations: `algorithms`
+2. Programming Problems: `programming-problems`
+3. Flashcards: `flashcards`
+
+## 1. Algorithm implementations
+
+Implementations of key algorithms for tackling programming problems. Language: Python 3.
+
+## 2. Programming Problems
+
+### Problems by Problem Areas
 Problems classified by area are from HackerRank. 
 
 **Finding these problems**: E.g. problems in the category 'Mathematics' are in a directory called 'mathematics'.
@@ -20,7 +33,8 @@ These problems are not classified by area, but by source. These problems are not
 * InterviewCake
 * Cracking the Coding Interview by Gabrielle Laakmann-McDowell (`laakmann-mcdowell`)
 
-### Flashcards
-Work-in-progress: flashcard content to import into Anki (flashcard software).
+## 3. Flashcards
+Flashcard content to import into Anki (flashcard software).
+
 * General programming terminology
 * Python syntax

alg-io.py

@@ -0,0 +1,35 @@
+# Algorithms
+
+Algorithms implemented in Python. Implementations of machine learning algorithms can be found in the directory `machine-learning`.
+
+Algorithms implemented:
+- Breadth-first search `bfs.py`
+- Depth-first search `dfs.py`
+- Flood fill (DFS version) `flood_fill.py`
+- Finding articulation points (brute force only)
+    - TODO: reframe as using backedge technique to (1) find articulation points, (2) find bridges
+- Dynamic programming (as ipynb)
+
+Data structures and environments implemented:
+- Graphs
+- 2D grid
+
+TODO:
+- BFS and DFS as part of the Graph class
+- Greedy
+- Dynamic programming as a .py file
+- Shortest path
+- Minimum Spanning Tree (MST)
+- Sorts
+- Searches
+    - Complete Search
+    - Heuristic search
+    - Approximate search
+- Knapsack
+- Computational geometry
+- Network flow
+- Eulerian Path
+- Two-dimensional convex hull
+- BigNums
+- Finding articulation points (uses backedges or bridges)
+- Other graph algorithms (Hamiltonian Path, Maximum Flow, min cost max flow, topological sort)