ullas kunder blog

Blogs
Contact
Projects
Visitor

All js dom react hooks guide markdown basic p5 dsa git github c++lib array regx advance stack ts nextjs mdx rss dev.to blog next-api ssr seo cms algorithms arrays prefixsum python javascript subarray brute-force interview hashmap optimal coding nodejs automation blogging productivity JavaScript debounce throttle event handling performance optimization search input scroll events requestAnimationFrame modern JavaScript Javascript event-loop task-queue microtasks macrotasks async call-stack execution-context web-development beginner-guide twopointer string slidingwindow PostgreSQL PostgreSQL Password Reset PostgreSQL Windows Reset Database Password Postgres Security Database Administration psql Tutorial PowerShell PostgreSQL PostgreSQL 17 slicing lists strings go wails system-tray desktop-app background-task goroutines trees graph-theory bfs dfs graphs search bst binary-search leetcode recursion intervals sliding-window linked-list heap divide-and-conquer graph flutter firebase mobileapp ai system-design rapid-prototyping dynamic-programming

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.
Sep 23, 2025
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.
Jun 26, 2025
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.
Jun 26, 2025
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.
Jun 26, 2025