Alexander Kazanski

Senior frontend engineer with a passion for performance, clean architecture, and the kind of UI details users notice but can't explain. Writing about JavaScript, DSA, and building things that last.

Joined on Apr 25, 2024

Alexander Kazanski

Jul 9

The Privacy Bug in Your Health App Isn't a Bug. It's the Architecture.

2 min read

Alexander Kazanski

Jul 9

Your Nutrition App Needs to Work in a Basement With No Signal

2 min read

Alexander Kazanski

Jul 9

I Rebuilt My Habit Tracker's Core Logic as One Hook. Here's What I Learned.

#javascript #productivity #react #webdev

2 min read

Alexander Kazanski

Jul 9

Nobody Reads Your Chart When They're Worried About Their Blood Pressure

2 min read

Alexander Kazanski

Jul 9

Your Health App's State Management Is Lying to You

2 min read

Alexander Kazanski

Jul 7

Particle Swarm Optimization: Learning from the Intelligence of Motion

3 min read

Alexander Kazanski

Jul 7

Grey Wolf Optimizer: Nature-Inspired Search for Better Solutions

2 min read

Alexander Kazanski

Jul 7

Artificial Bee Colony: Nature-Inspired Optimization for Scheduling

2 min read

Alexander Kazanski

Jun 28

Sorting each word gives you a canonical key — two words with the same key are anagrams. This one-pass hash map groups them all in O(n·k).

1 min read

Alexander Kazanski

Jun 28

BFS with a queue is the cleanest way to visit a tree level by level. Great for 'return nodes at depth k' problems — here's the template.

1 min read

Alexander Kazanski

Jun 28

Reversing a linked list in-place is the most-asked linked list question. Three pointers, no extra memory — here's how it works.

1 min read

Alexander Kazanski

Jun 28

Binary search cuts your search space in half every step — O(log n) instead of O(n). This template handles every sorted-array problem.

1 min read

Alexander Kazanski

Jun 28

Balanced brackets are a classic interview warm-up — and a stack is the perfect tool. Here's the cleanest JS version I know.

1 min read

Alexander Kazanski

Jun 28

Naive Fibonacci is a trap — it recalculates the same values millions of times. Add a memo object and you drop from O(2ⁿ) to O(n) instantly.

1 min read

Alexander Kazanski

Jun 28

Bubble sort is O(n ) and nobody ships it — but understanding why it works makes every other sort click. Worth 5 minutes of your time.

1 min read

Alexander Kazanski

Jun 28

Stop looping twice. Here's how a single hash map pass solves Two Sum in O(n) — the trick every interviewer expects you to know.

1 min read

DEV Community

Alexander Kazanski

Badges

Two Year Club

One Year Club

The Privacy Bug in Your Health App Isn't a Bug. It's the Architecture.

Your Nutrition App Needs to Work in a Basement With No Signal

I Rebuilt My Habit Tracker's Core Logic as One Hook. Here's What I Learned.

Nobody Reads Your Chart When They're Worried About Their Blood Pressure

Your Health App's State Management Is Lying to You

Particle Swarm Optimization: Learning from the Intelligence of Motion

Grey Wolf Optimizer: Nature-Inspired Search for Better Solutions

Artificial Bee Colony: Nature-Inspired Optimization for Scheduling

Sorting each word gives you a canonical key — two words with the same key are anagrams. This one-pass hash map groups them all in O(n·k).

BFS with a queue is the cleanest way to visit a tree level by level. Great for 'return nodes at depth k' problems — here's the template.

Reversing a linked list in-place is the most-asked linked list question. Three pointers, no extra memory — here's how it works.

Binary search cuts your search space in half every step — O(log n) instead of O(n). This template handles every sorted-array problem.

Balanced brackets are a classic interview warm-up — and a stack is the perfect tool. Here's the cleanest JS version I know.

Naive Fibonacci is a trap — it recalculates the same values millions of times. Add a memo object and you drop from O(2ⁿ) to O(n) instantly.

Bubble sort is O(n ) and nobody ships it — but understanding why it works makes every other sort click. Worth 5 minutes of your time.

Stop looping twice. Here's how a single hash map pass solves Two Sum in O(n) — the trick every interviewer expects you to know.