Add Claude to Code Reviews

Author: pertrai1

.github/workflows/claude-pr-review.yml

@@ -0,0 +1,22 @@
+name: Claude Code Review
+on:
+  pull_request:
+    types: [opened, synchronize]
+
+jobs:
+  review:
+    runs-on: ubuntu-latest
+    permissions:
+      contents: read
+      pull-requests: write
+    steps:
+      - uses: actions/checkout@v4
+        with:
+          fetch-depth: 0
+      - name: Run Claude Code Review
+        uses: anthropics/claude-code-action@beta
+        with:
+          anthropic_api_key: ${{ secrets.ANTHROPIC_API_KEY }}
+          prompt: |
+            Review this PR for potential bugs, security issues, 
+            and adherence to our coding standards.

CLAUDE.md

@@ -0,0 +1,57 @@
+# CLAUDE.md - Code Review Guidelines
+
+## Repository Purpose
+This repository contains LeetCode problem solutions for learning and practicing algorithmic problem-solving. Solutions are primarily written in JavaScript/TypeScript.
+
+## Code Review Focus
+
+### 1. Algorithm Correctness
+- Verify the solution correctly solves the problem for all test cases
+- Check for edge cases: empty arrays, single elements, negative numbers, null values
+- Confirm the solution handles constraints mentioned in the problem
+
+### 2. Time & Space Complexity
+- Always analyze and comment on time complexity (Big O notation)
+- Always analyze and comment on space complexity
+- Suggest optimizations if a more efficient approach exists
+- Compare to optimal solutions when applicable
+
+### 3. Code Quality
+- Use clear, descriptive variable names (not just `i`, `j`, `k` unless in simple loops)
+- Add comments for non-obvious logic or algorithm steps
+- Keep functions focused and single-purpose
+- Prefer readability over cleverness
+
+### 4. JavaScript/TypeScript Best Practices
+- Use `const` by default, `let` only when reassignment needed
+- Avoid `var`
+- Use modern ES6+ syntax (arrow functions, destructuring, spread operators)
+- Prefer built-in methods (`.map()`, `.filter()`, `.reduce()`) when appropriate
+- Use strict equality (`===`) over loose equality (`==`)
+
+### 5. Problem-Specific Patterns
+When reviewing graph problems:
+- Verify proper graph representation (adjacency list/matrix)
+- Check for visited tracking to avoid cycles
+- Confirm DFS/BFS implementation follows standard patterns
+- Look for Union-Find correctness if applicable
+
+When reviewing array/string problems:
+- Check for two-pointer technique correctness
+- Verify sliding window boundaries
+- Confirm hash map usage is optimal
+
+### 6. README Requirements
+Each problem solution should include:
+- Problem description or link to LeetCode problem
+- Approach explanation
+- Time and space complexity analysis
+- Any key insights or learnings
+
+## What NOT to Flag
+- Multiple solution approaches (exploratory learning is encouraged)
+- Console.log statements (used for debugging/learning)
+- Less optimal solutions if clearly marked as alternative approaches
+
+## Tone
+Keep feedback constructive and educational. This is a learning repository, so explain *why* something could be improved, not just *what* to change.