Study Summary — May 27, 2026

LeetCode — Median of Two Sorted Arrays (Hard)

Key Concepts

• Two-pointer binary search approach: Use binary search on the shorter array to partition both arrays efficiently in O(log min(m,n)) space

• Partition logic: Find a partition point where all elements on the left are ≤ all elements on the right

• Median calculation: For odd-length merged array, median is the max of left partition; for even length, it's the average of partition boundaries

• Edge case handling: Account for empty partitions and ensure O(log(m+n)) time complexity requirement

• Practice tip: Start with naive O((m+n)log(m+n)) merge-and-sort approach, then optimize to O(log(m+n)) using binary search

Professional Programming — Database Design & Architecture

• Patterns of Enterprise Application Architecture by Martin Fowler — Teaches real-world database usage patterns and architectural approaches

• Database Scaling Strategies — Essential techniques for handling growth at scale

• SQL Best Practices and Optimization — Core skills for efficient database design

Key Concepts

• Schema design matters: Well-designed schemas reduce bugs and maintenance costs; prioritize clarity and normalization early

• Scaling considerations: Plan for indexing, partitioning, and replication strategies before hitting performance walls

• Query optimization: Understanding execution plans and avoiding N+1 queries is critical for production systems

• Data consistency: Choose between ACID transactions and eventual consistency based on use case

• Monitoring and observability: Track query performance and database metrics to catch issues before users do

Claude Code Docs — Common Workflows

Key Concepts

• Building features: Describe what you want in plain language; Claude Code plans the approach, writes code across multiple files, and verifies it works

• Debugging efficiently: Paste error messages or describe symptoms; Claude traces issues through your codebase to identify root causes and implement fixes

• Automating repetitive tasks: Write tests for untested code, fix lint errors across a project, resolve merge conflicts, and update dependencies automatically

• Git integration: Claude Code works directly with git—stages changes, writes commit messages, creates branches, and opens pull requests

• Multi-file coordination: Understand how to structure prompts for complex changes that span multiple files and dependencies

ByteByteGo — CI/CD Pipeline Explained in Simple Terms

Key Concepts

• Automation drives reliability: CI/CD automates build, test, and deployment stages to enable faster, more reliable releases with reduced human error

• Developer feedback loop: Continuous Integration detects integration issues early; developers get rapid feedback on every commit, encouraging frequent, small commits

• Staging before production: Typical pipelines deploy to staging environments first for further testing before production, reducing blast radius of bugs

• SDLC transformation: The traditional development → testing → deployment → maintenance cycle becomes automated and continuous, enabling daily releases

• Success criteria: End-to-end tests must pass; on failure, code returns to dev for fixes rather than progressing to production