# AlgoPulse: Algorithmic Patterns & Technical Interview Laboratory
> Interactive developer platform for practicing core computer science algorithms with client-side Web Worker sandboxing, automated Big-O complexity analysis, and Cloudflare D1 persistence.

## System Capabilities
- **In-Browser Execution**: Isolated client-side Web Worker running Sucrase-compiled TypeScript code with console interception and execution timeouts.
- **Complexity Analysis**: Automated runtime verification across time complexity (Big-O) and auxiliary space complexity.
- **Architectural Patterns**: 12 fundamental data structure and algorithmic paradigms curated for senior engineering interview preparation.
- **Cloud Synchronization**: Cloudflare D1 edge database persistence and LocalStorage crash-resilient auto-saving.

## Core Problem Directory & Algorithmic Paradigms

### 1. Valid Palindrome (`01-palindrome`)
- **Paradigm**: Two Pointers, In-Place String Scanning
- **Target Complexity**: Time O(N), Space O(1)
- **URL**: https://algo-practice-app.pages.dev/problem/01-palindrome

### 2. Two Sum (`02-two-sum`)
- **Paradigm**: Hash Map Complement Lookup
- **Target Complexity**: Time O(N), Space O(N)
- **URL**: https://algo-practice-app.pages.dev/problem/02-two-sum

### 3. Valid Parentheses (`03-valid-parentheses`)
- **Paradigm**: Monotonic Stack, Character Invariant Matching
- **Target Complexity**: Time O(N), Space O(N)
- **URL**: https://algo-practice-app.pages.dev/problem/03-valid-parentheses

### 4. Valid Anagram (`04-valid-anagram`)
- **Paradigm**: Frequency Counting, Fixed-Array Frequency Hashing
- **Target Complexity**: Time O(N), Space O(1) auxiliary (bounded alphabet)
- **URL**: https://algo-practice-app.pages.dev/problem/04-valid-anagram

### 5. String Compression (`05-string-compression`)
- **Paradigm**: Two Pointers, Run-Length Encoding
- **Target Complexity**: Time O(N), Space O(N)
- **URL**: https://algo-practice-app.pages.dev/problem/05-string-compression

### 6. Currency Conversion (`06-currency-conversion`)
- **Paradigm**: Graph Representation (Adjacency Map), Breadth-First Search (BFS) Traversal with Path Accumulation
- **Target Complexity**: Time O(V + E), Space O(V)
- **URL**: https://algo-practice-app.pages.dev/problem/06-currency-conversion

### 7. Best Time to Buy and Sell Stock (`07-best-time-to-buy-and-sell-stock`)
- **Paradigm**: Greedy Single-Pass, Running Minimum Tracking
- **Target Complexity**: Time O(N), Space O(1)
- **URL**: https://algo-practice-app.pages.dev/problem/07-best-time-to-buy-and-sell-stock

### 8. Binary Search (`08-binary-search`)
- **Paradigm**: Divide and Conquer, Logarithmic Search Space Halving
- **Target Complexity**: Time O(log N), Space O(1)
- **URL**: https://algo-practice-app.pages.dev/problem/08-binary-search

### 9. Climbing Stairs (`09-climbing-stairs`)
- **Paradigm**: Dynamic Programming (Bottom-Up Memoization / Fibonacci Linear Recurrence)
- **Target Complexity**: Time O(N), Space O(1)
- **URL**: https://algo-practice-app.pages.dev/problem/09-climbing-stairs

### 10. Merge Sorted Arrays (`10-merge-sorted-arrays`)
- **Paradigm**: Two Pointers, Sorted Interleaving
- **Target Complexity**: Time O(N + M), Space O(N + M)
- **URL**: https://algo-practice-app.pages.dev/problem/10-merge-sorted-arrays

### 11. Maximum Subarray (`11-maximum-subarray`)
- **Paradigm**: Kadane's Algorithm, Dynamic Programming Optimization
- **Target Complexity**: Time O(N), Space O(1)
- **URL**: https://algo-practice-app.pages.dev/problem/11-maximum-subarray

### 12. Longest Common Prefix (`12-longest-common-prefix`)
- **Paradigm**: Horizontal Scanning, Character Matrix Cross-Matching
- **Target Complexity**: Time O(S) where S is the sum of characters across strings, Space O(1)
- **URL**: https://algo-practice-app.pages.dev/problem/12-longest-common-prefix