← home

Writing / 63 entries

Code, Solutions
& Discovery.

A public digital garden — bugs, breakthroughs, and the chaos of building things on the web.

↳ algorithms
clear↓ newest
alldsa34python29interview26leetcode22algorithms16guide11
09
Oct 1, 2025#algorithms#javascript

solve leetcode Reverse an Array

Learn how to reverse an array efficiently using brute force and optimal approaches in Python and JavaScript.

10
Oct 1, 2025#algorithms#javascript

solve leetcode find minimum and maximum in an array

Learn how to efficiently find the smallest and largest elements in an array using simple and optimal techniques in Python and JavaScript.

11
Oct 1, 2025#algorithms#javascript

solve leetcode Rotate an array to the right by k steps

Learn how to rotate an array efficiently using the reverse approach in Python and JavaScript with step-by-step explanation.

12
Sep 23, 2025#algorithms#arrays

Two Sum – Brute Force vs Hashing

Solve the classic Two Sum problem using brute-force and optimized hashing techniques, a must-know algorithm for coding interviews.

13
Sep 23, 2025#algorithms#string

Longest Substring Without Repeating Characters – Sliding Window

Learn how to efficiently find the longest substring with unique characters using sliding window and hashmap in Python and JavaScript.

14
Jun 26, 2025#algorithms#arrays

Check if a Subarray with Zero Sum Exists – Prefix Sum in Action

Understand how to check for a zero-sum subarray using both brute-force and prefix sum techniques, with step-by-step code in Python and JavaScript.

15
Jun 26, 2025#algorithms#arrays

Find Pair with Given Sum in an Array – Brute-force and Optimal Approaches

Explore how to find two elements in an array that sum up to a target value using brute-force and hash map techniques in both Python and JavaScript.

16
Jun 26, 2025#algorithms#arrays

Print All Zero-Sum Subarrays – From Brute-Force to Prefix Hashing

Explore how to find and print all subarrays that sum to zero using both brute-force and efficient prefix-sum + hashmap techniques in Python.

prev02 / 02next