#problem-solving

Apply systematic creative problem-solving process for breakthrough innovation solutions. Problem definition phase: 1. Challenge framing: rewrite problem multiple ways to find best angle. 2. Root cause analysis: 5 whys technique to identify underlying issues. 3. Constraint mapping: identify real vs. perceived limitations. 4. Stakeholder analysis: who is affected, who can influence solution. Ideation phase: 1. Divergent thinking: generate 50+ ideas without judgment. 2. Cross-industry inspiration: solutions from unrelated fields. 3. Worst possible idea: reverse brainstorming to unlock new thinking. 4. Build on ideas: 'yes, and' methodology to develop concepts. Solution development: 1. Idea clustering: group similar concepts, identify themes. 2. Feasibility assessment: technical, financial, timeline constraints. 3. Impact evaluation: potential for meaningful change. 4. Hybrid solutions: combine elements from different ideas. Validation: 1. Rapid prototyping: quick tests of core assumptions. 2. User feedback: target audience input on concepts. 3. Pilot programs: small-scale implementation before full rollout. Documentation: decision rationale, learning capture for future projects.

Debug efficiently with systematic approach. Process: 1. Reproduce the bug consistently. 2. Isolate the problem (binary search through code). 3. Form hypothesis about cause. 4. Test hypothesis (add logging, use debugger). 5. Fix the root cause, not symptoms. 6. Verify fix doesn't break other functionality. 7. Add test to prevent regression. Techniques: rubber duck debugging, print statements, breakpoints, stack traces. Read error messages carefully. Check recent changes (git blame). Search Stack Overflow. Take breaks if stuck. Document solution. Prevention: write tests first, code reviews, static analysis.

Master common algorithm patterns for coding interviews. Patterns: 1. Two Pointers (sorted arrays, palindromes). 2. Sliding Window (subarray problems, max/min in window). 3. Fast & Slow Pointers (cycle detection in linked lists). 4. Merge Intervals (overlapping ranges). 5. Cyclic Sort (missing numbers in range). 6. In-place Reversal (linked list reversal). 7. BFS/DFS (tree/graph traversal). 8. Binary Search (sorted data, optimization problems). 9. Top K Elements (heaps, quickselect). 10. Dynamic Programming (optimization, counting). For each pattern: recognize problem type, apply template, practice 5-10 problems. Use LeetCode, HackerRank.